Stem rectangl$ (all stems)

38 papers:

STOC-2015-GoosLM0Z

Rectangles Are Nonnegative Juntas (MG, SL, RM, TW, DZ), pp. 257–266.

ICALP-v1-2014-AfshaniCT #ram

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM (PA, TMC, KT), pp. 77–88.

ICALP-v1-2014-KolMSY #approximate #bound #rank

Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.

KR-2014-ZhangR #algebra #reasoning #representation

Qualitative Spatial Representation and Reasoning in Angry Birds: The Extended Rectangle Algebra (PZ, JR).

ICDAR-2013-ChenYL #hybrid #performance #segmentation

Hybrid Page Segmentation with Efficient Whitespace Rectangles Extraction and Grouping (KC, FY, CLL), pp. 958–962.

PODS-2012-TirthapuraW #data type

Rectangle-efficient aggregation in spatial data streams (ST, DPW), pp. 283–294.

ICPR-2012-Lee #constraints #image

Camera calibration from a single image based on coupled line cameras and rectangle constraint (JHL), pp. 758–762.

DAC-2010-KongMYW #algorithm

An optimal algorithm for finding disjoint rectangles and its application to PCB routing (HK, QM, TY, MDFW), pp. 212–217.

ICPR-2010-BenedekDZ #detection #image #process

Building Detection in a Single Remotely Sensed Image with a Point Process of Rectangles (CB, XD, JZ), pp. 1417–1420.

ICDAR-2009-WangC #bound #detection #documentation #image

Logo Detection in Document Images Based on Boundary Extension of Feature Rectangles (HW, YC), pp. 1335–1339.

STOC-2009-AronovES

Small-size epsilon-nets for axis-parallel rectangles and boxes (BA, EE, MS), pp. 639–648.

HCI-NIMT-2009-Pastel #2d #modelling

Modeling the Difficulty for Centering Rectangles in One and Two Dimensions (RP), pp. 879–888.

ICLP-2008-Parisini #constraints

Bi-dimensional Domains for the Non-overlapping Rectangles Constraint (FP), pp. 811–812.

ICPR-v1-2006-AbufadelSUZO #estimation

Interacting Active Rectangles for Estimation of Intervertebral Disk Orientation (AA, GGS, GBU, LZ, BO), pp. 1013–1016.

ICPR-v1-2006-KimK06a #parametricity #using

Estimating Intrinsic Parameters of Cameras using Two Arbitrary Rectangles (JSK, ISK), pp. 707–710.

DATE-v1-2004-HandaV #algorithm #performance

A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement (MH, RV), pp. 744–745.

ICALP-2004-Paluch #algorithm #approximate

A 2(1/8)-Approximation Algorithm for Rectangle Tiling (KEP), pp. 1054–1065.

ICDAR-2003-Breuel #algorithm #analysis #documentation #layout

An Algorithm for Finding Maximal Whitespace Rectangles at Arbitrary Orientations for Document Layout Analysis (TMB), pp. 66–70.

ICPR-v3-2002-VinsonC #3d #multi #re-engineering #segmentation

Multiple Rectangle Model for Vuildings Segmentation and 3D Scene Reconstruction (SV, LDC), pp. 623–626.

ICPR-v4-2002-CinqueRLLT #image #query #retrieval #using

Image Retrieval Using Resegmentation Driven by Query Rectangles (LC, FDR, FL, SL, SLT), pp. 142–145.

ICML-2001-PellegM #clustering

Mixtures of Rectangles: Interpretable Soft Clustering (DP, AWM), pp. 401–408.

KR-2000-Condotta #network

The Augmented Interval and Rectangle Networks (JFC), pp. 571–579.

ICDAR-1999-SuralD #algorithm #documentation #generative #image #parallel #segmentation

A Two-step Algorithm and its Parallelization for the Generation of Minimum Containing Rectangles for Document Image Segmentation (SS, PKD), pp. 173–176.

STOC-1999-KumarR

Covering Rectilinear Polygons with Axis-Parallel Rectangles (VSAK, HR), pp. 445–454.

ICALP-1998-Lu #combinator #generative #pseudo

Improved Pseudorandom Generators for Combinatorial Rectangles (CJL), pp. 223–234.

ICDAR-1997-CesariniFGMSS97a #comprehension

Rectangle Labelling for an Invoice Understanding System (FC, EF, MG, SM, JS, GS), pp. 324–330.

STOC-1997-AuerLS #approximate #learning #pseudo #set

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets (PA, PML, AS), pp. 314–323.

ICDAR-v2-1995-LiH #robust

A Robust Method of Extracting Rectangle Blocks for Form Reading (XL, JH), p. 760–?.

SIGMOD-1995-PapadiasTSE #bound #case study

Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees (DP, YT, TKS, MJE), pp. 92–103.

STOC-1993-LinialLSZ #combinator #performance #set

Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.

DAC-1991-SoeK #logic #using

Logic Minimization using Two-column Rectangle Replacement (SS, KK), pp. 470–473.

SIGMOD-1990-BeckmannKSS #performance #robust

The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles (NB, HPK, RS, BS), pp. 322–331.

DAC-1986-LinA #bound #layout #named

Minplex — a compactor that minimizes the bounding rectangle and individual rectangles in a layout (SLL, JA), pp. 123–130.

DAC-1984-Roach

The rectangle placement language (JAR), pp. 405–411.

STOC-1984-FranzblauK #algorithm #generative #independence #set

An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals (DSF, DJK), pp. 167–174.

STOC-1981-DolevKSSU

Optimal Wiring between Rectangles (DD, KK, AS, AS, JDU), pp. 312–317.

STOC-1980-GuibasY #on the #set

On Translating a Set of Rectangles (LJG, FFY), pp. 154–160.

DAC-1977-CageS #multi

A rectangle-probe router for multilayer P.C. boards (WGC, RJSI), pp. 13–22.