684 search results - page 45 / 137 » On embedding well-separable graphs |
142
click to vote
NIPS
2008
15 years 5 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
121
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
137
click to vote
LCTRTS
2007
Springer
15 years 10 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
122
click to vote
CHI
2006
ACM
16 years 4 months ago
2006
ACM
As graph models are applied to more widely varying fields, researchers struggle with tools for exploring and analyzing these structures. We describe GUESS, a novel system for grap...
121
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...