21324 search results - page 3902 / 4265 » Making the case for computing |
158
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
142
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
155
click to vote
FTDCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
113
click to vote
DCOSS
2006
Springer
15 years 8 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
149
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...