2255 search results - page 176 / 451 » Computing a Center-Transversal Line |
157
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
137
Voted
MICRO
2006
IEEE
15 years 3 months ago
2006
IEEE
We examine the ability of CMPs, due to their lower onchip communication latencies, to exploit data parallelism at inner-loop granularities similar to that commonly targeted by vec...
137
Voted
TALG
2008
15 years 3 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
169
Voted
ICPP
1994
IEEE
15 years 7 months ago
1994
IEEE
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
226
click to vote
GIS
2008
ACM
16 years 4 months ago
2008
ACM
An index is devised to support position-independent search for images containing quartets of icons. Point quartets exist that do not unambiguously map to quadrilaterals, however, ...