Sciweavers

1532 search results - page 180 / 307
» Connection Relations in Mereotopology
Sort
View
84
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter
COCOON
2003
Springer
15 years 6 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
ICALP
2001
Springer
15 years 5 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
VRML
1995
ACM
15 years 4 months ago
Internetwork Infrastructure Requirements for Virtual Environments
Virtual environments (VEs) are a broad multidisciplinary research area that includes all aspects of computer science, virtual reality, virtual worlds, teleoperation and telepresenc...
Donald P. Brutzman, Michael R. Macedonia, Michael ...
COLT
2008
Springer
15 years 2 months ago
Adaptive Hausdorff Estimation of Density Level Sets
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
Aarti Singh, Robert Nowak, Clayton Scott