Sciweavers

361 search results - page 16 / 73
» Relaxed Gabriel Graphs
Sort
View
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 7 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
CVPR
2008
IEEE
14 years 9 months ago
Relaxed matching kernels for robust image comparison
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...
Andrea Vedaldi, Stefano Soatto
KCAP
2005
ACM
14 years 1 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
GRAPHICSINTERFACE
1996
13 years 8 months ago
Awareness Through Fisheye Views in Relaxed-WYSIWIS Groupware
Desktop conferencing systems are now shifting from strict view-sharing towards relaxed "what-you-see-iswhat-I-see" interfaces, where distributed participants in a real t...
Saul Greenberg, Carl Gutwin, Andy Cockburn
PERCOM
2006
ACM
14 years 7 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...