3092 search results - page 344 / 619 » Where are you pointing |
181
click to vote
AIPR
2007
IEEE
16 years 17 days ago
2007
IEEE
Geometric structure of a scene can be reconstructed using many methods. In recent years, two prominent approaches have been digital photogrammetric analysis using passive stereo i...
176
click to vote
IROS
2007
IEEE
16 years 15 days ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
131
click to vote
GD
2007
Springer
16 years 11 days ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
152
click to vote
HPCC
2007
Springer
16 years 11 days ago
2007
Springer
One of the outcomes of DARPA’s HPCS program has been the creation of three new high productivity languages: Chapel, Fortress, and X10. While these languages have introduced impro...
168
click to vote
COMPGEOM
2006
ACM
16 years 5 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...