89 search results - page 16 / 18 » Constructing Reeb graphs using cylinder maps |
ALGORITHMICA
2002
14 years 9 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
120
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
SECON
2007
IEEE
15 years 3 months ago
2007
IEEE
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...