934 search results - page 105 / 187 » A theoretical analysis of the HIFF problem |
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
PODC
2009
ACM
15 years 2 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
NICSO
2010
Springer
15 years 1 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...