Sciweavers

22 search results - page 4 / 5
» On planarity of compact, locally connected, metric spaces
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 3 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
TROB
2002
126views more  TROB 2002»
14 years 11 months ago
Modeling and controllability for a class of hybrid mechanical systems
Abstract-- This work studies a class of hybrid mechanical systems that locomote by switching between constraints defining different dynamic regimes. We develop a geometric framewor...
Francesco Bullo, Milos Zefran
100
Voted
NIPS
2003
15 years 1 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
ASPDAC
2005
ACM
138views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Crowdedness-balanced multilevel partitioning for uniform resource utilization
In this paper, we propose a new multi-objective multilevel K-way partitioning which is aware of resource utilization distribution, assuming the resource utilization for a partitio...
Yongseok Cheon, Martin D. F. Wong
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
14 years 11 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka