Sciweavers

3394 search results - page 116 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
IJCAI
2001
13 years 9 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
DAC
2005
ACM
14 years 9 months ago
ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction
This paper presents an efficient hierarchical 3D capacitance extraction algorithm -- ICCAP. Most previous capacitance extraction algorithms introduce intermediate variables to fac...
Rong Jiang, Yi-Hao Chang, Charlie Chung-Ping Chen
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
14 years 9 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
GD
2007
Springer
13 years 11 months ago
Efficient Extraction of Multiple Kuratowski Subdivisions
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
Markus Chimani, Petra Mutzel, Jens M. Schmidt