Sciweavers

1201 search results - page 111 / 241
» Linear Probing and Graphs
Sort
View
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
15 years 2 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable
91
Voted
IJON
2006
103views more  IJON 2006»
15 years 23 days ago
Kernel extrapolation
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
S. V. N. Vishwanathan, Karsten M. Borgwardt, Omri ...
101
Voted
JSAT
2006
87views more  JSAT 2006»
15 years 23 days ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
98
Voted
ACL
2010
14 years 11 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum
WINE
2009
Springer
171views Economy» more  WINE 2009»
15 years 7 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...