Sciweavers

260 search results - page 42 / 52
» Quality guarantees for region optimal DCOP algorithms
Sort
View
IPSN
2007
Springer
15 years 8 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
135
Voted
SIGIR
1999
ACM
15 years 6 months ago
Content-Based Retrieval Using Heuristic Search
The fast growth of multimedia information in image and video databases has triggered research on efficient retrieval methods. This paper deals with structural queries, a type of c...
Dimitris Papadias, Marios Mantzourogiannis, Panos ...
VISUALIZATION
1999
IEEE
15 years 6 months ago
Time-Critical Multiresolution Scene Rendering
We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a sce...
Enrico Gobbetti, Eric Bouvier
CVPR
2010
IEEE
15 years 2 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
110
Voted
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
15 years 10 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...