Sciweavers

73 search results - page 12 / 15
» Labeling Schemes for Vertex Connectivity
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Consistent Correspondence between Arbitrary Manifold Surfaces
We propose a novel framework for consistent correspondence between arbitrary manifold meshes. Different from most existing methods, our approach directly maps the connectivity of ...
Huai-yu Wu, Chunhong Pan, Qing Yang, Songde Ma
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
15 years 10 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 1 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
CORR
2010
Springer
190views Education» more  CORR 2010»
14 years 9 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 9 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy