Sciweavers

1493 search results - page 56 / 299
» Local resilience of graphs
Sort
View
STACS
1994
Springer
13 years 11 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
ICS
2010
Tsinghua U.
14 years 5 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ISCC
2005
IEEE
14 years 1 months ago
Hierarchical Peer-to-Peer Networks Using Lightweight SuperPeer Topologies
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou
IROS
2007
IEEE
198views Robotics» more  IROS 2007»
14 years 2 months ago
Topological mapping, localization and navigation using image collections
Abstract— In this paper we present a highly scalable visionbased localization and mapping method using image collections. A topological world representation is created online dur...
Friedrich Fraundorfer, Christopher Engels, David N...
ICPR
2008
IEEE
14 years 9 months ago
Local Regularized Least-Square Dimensionality Reduction
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
Changshui Zhang, Yangqing Jia