Sciweavers

425 search results - page 62 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
15 years 1 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
15 years 9 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
95
Voted
PAMI
2006
181views more  PAMI 2006»
14 years 9 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
CNSM
2010
14 years 7 months ago
DP+IP = design of efficient backup scheduling
Many industries experience an explosion in digital content. This explosion of electronic documents, along with new regulations and document retention rules, sets new requirements f...
Ludmila Cherkasova, Alex Zhang, Xiaozhou Li
102
Voted
DKE
2002
113views more  DKE 2002»
14 years 9 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...