Sciweavers

1370 search results - page 144 / 274
» On grids in topological graphs
Sort
View
PR
2007
88views more  PR 2007»
15 years 6 months ago
Robust kernel Isomap
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
Heeyoul Choi, Seungjin Choi
CONEXT
2008
ACM
15 years 8 months ago
Power-law chord architecture in P2P overlays
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and an efficient resource localization service at...
Salma Ktari, Artur Hecker, Houda Labiod
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 11 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
INFOCOM
2007
IEEE
16 years 23 days ago
On Scalability of Proximity-Aware Peer-to-Peer Streaming
—P2P (peer-to-peer) technology has proved itself an efficient and cost-effective solution to support large-scale multimedia streaming. Different from traditional P2P application...
Liang Dai, Yi Cui, Yuan Xue