674 search results - page 46 / 135 » The computational complexity of the parallel knock-out probl... |
123
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
104
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
124
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Document clustering plays an important role in data mining systems. Recently, a flocking-based document clustering algorithm has been proposed to solve the problem through simulat...
112
click to vote
ACPC
1999
Springer
15 years 5 months ago
1999
Springer
For lighting simulations in architecture there is the need for correct illumination calculation of virtual scenes. The Radiance Synthetic Imaging System delivers an excellent solut...