32545 search results - page 145 / 6509 » Data Structures and Algorithms |
139
click to vote
ML
2010
ACM
15 years 1 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
145
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
132
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
117
click to vote
OSDI
2008
ACM
16 years 3 months ago
2008
ACM
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
158
click to vote
MST
2006
15 years 3 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...