Sciweavers

1068 search results - page 185 / 214
» On Space Bounded Server Algorithms
Sort
View
FOCS
2004
IEEE
15 years 6 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
SOFSEM
2000
Springer
15 years 6 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
VIS
2006
IEEE
122views Visualization» more  VIS 2006»
16 years 4 months ago
Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
Wan-Chiu Li, Bruno Vallet, Nicolas Ray, Bruno L...
ICML
2008
IEEE
16 years 3 months ago
An RKHS for multi-view learning and manifold co-regularization
Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs)...
Vikas Sindhwani, David S. Rosenberg
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
16 years 3 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos