2107 search results - page 231 / 422 » Computing Small Search Numbers in Linear Time |
CONCURRENCY
2007
13 years 9 months ago
2007
We propose in this paper a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix w...
ECSQARU
2009
Springer
14 years 3 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
CGI
2000
IEEE
14 years 1 months ago
2000
IEEE
Realistic animation of soft objects such as cloth is essential for plausible character animation. Many techniques have been proposed for the simulation of soft objects, and most o...
IRI
2006
IEEE
14 years 3 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...