7379 search results - page 1124 / 1476 » How Many Clusters |
142
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
131
click to vote
CSCW
2008
ACM
15 years 6 months ago
2008
ACM
Wikipedia's success is often attributed to involving large numbers of contributors who improve the accuracy, completeness and clarity of articles while reducing bias. However...
184
click to vote
DAMON
2008
Springer
15 years 6 months ago
2008
Springer
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
141
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
142
Voted
ICADL
2007
Springer
15 years 6 months ago
2007
Springer
Digitizing ancient books, especially those related to the humanities, is practiced in many countries. The number of full-text databases in the humanities is increasing. Studies hav...