270 search results - page 45 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
COMPGEOM
2004
ACM
15 years 3 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...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
CONEXT
2007
ACM
15 years 1 months ago
2007
ACM
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
107
click to vote
SIGMETRICS
2006
ACM
15 years 3 months ago
2006
ACM
Despite the existence of several secure BGP routing protocols, there has been little progress to date on actual adoption. Although feasibility for widespread adoption remains the ...
PODC
2009
ACM
15 years 4 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...