1538 search results - page 71 / 308 » Spectral Techniques in Graph Algorithms |
117
click to vote
ISSS
1999
IEEE
15 years 5 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
100
click to vote
VISUALIZATION
2000
IEEE
15 years 5 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
135
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
148
click to vote
DIS
2007
Springer
15 years 5 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
104
click to vote
EDBT
2008
ACM
15 years 3 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...