5608 search results - page 741 / 1122 » On the Theory of Matchgate Computations |
153
click to vote
CVPR
2010
IEEE
16 years 4 days ago
2010
IEEE
The phenomenon of visual curve completion, where the visual system completes the missing part (e.g., due to occlusion) between two contour fragments, is a major problem in percept...
163
click to vote
GLVLSI
2003
IEEE
16 years 3 days ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
142
click to vote
PODC
2003
ACM
16 years 1 days ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
198
click to vote
SMA
2003
ACM
16 years 1 days ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
216
click to vote
WSNA
2003
ACM
16 years 1 days ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...