4212 search results - page 582 / 843 » On Compressible Pairings and Their Computation |
174
click to vote
COMPGEOM
2006
ACM
16 years 21 days ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
173
click to vote
AVSS
2005
IEEE
16 years 11 days ago
2005
IEEE
We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the...
246
click to vote
ISPD
2005
ACM
16 years 9 days ago
2005
ACM
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
166
click to vote
SAC
2003
ACM
15 years 12 months ago
2003
ACM
Test Driven Development (TDD) is a software development practice in which unit test cases are incrementally written prior to code implementation. In our research, we ran a set of ...
216
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...