Sciweavers

1511 search results - page 154 / 303
» Randomness, lowness and degrees
Sort
View
BVAI
2005
Springer
15 years 12 months ago
Incomplete Contour Representations and Shape Descriptors: ICR Test Studies
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
Anarta Ghosh, Nicolai Petkov
AP2PC
2004
Springer
15 years 11 months ago
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
George H. L. Fletcher, Hardik A. Sheth, Katy B&oum...
INFOCOM
2000
IEEE
15 years 10 months ago
An Empirical Evaluation of Client-Side Server Selection Algorithms
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
INFOCOM
2000
IEEE
15 years 10 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
15 years 10 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal