Sciweavers

139 search results - page 23 / 28
» A New Algorithm for Multi-objective Graph Partitioning
Sort
View
COMPGEOM
2003
ACM
14 years 1 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
VLDB
2002
ACM
116views Database» more  VLDB 2002»
13 years 7 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
CVPR
2009
IEEE
1298views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Video Object Segmentation by Hypergraph Cut
In this paper, we present a new framework of video object segmentation, in which we formulate the task of extracting prominent objects from a scene as the problem of hypergraph ...
Dimitris N. Metaxas, Qingshan Liu, Yuchi Huang
COMPGEOM
2004
ACM
14 years 1 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
INFOCOM
2012
IEEE
11 years 10 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...