4926 search results - page 626 / 986 » Two Graph Algorithms On an Associative Computing Model |
114
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— Controlling the topology of a wireless ad hoc network is very important from the point of view of performance. One known technique for controlling the topology is throu...
120
click to vote
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
169
click to vote
PROMISE
2010
14 years 9 months ago
2010
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
149
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
127
Voted
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...