Sciweavers

941 search results - page 59 / 189
» Efficient Testing of Large Graphs
Sort
View
TVCG
2008
145views more  TVCG 2008»
14 years 9 months ago
Geometry-Based Edge Clustering for Graph Visualization
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, ...
ECCV
2008
Springer
15 years 8 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
14 years 9 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
CIKM
2008
Springer
14 years 11 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
15 years 10 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...