Sciweavers

5752 search results - page 158 / 1151
» Informative Labeling Schemes
Sort
View
AAAI
2008
15 years 5 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao
CAGD
2006
114views more  CAGD 2006»
15 years 3 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp
ATAL
2009
Springer
15 years 10 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
CLOUD
2010
ACM
15 years 8 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
DGCI
2006
Springer
15 years 7 months ago
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
The aim of this article is to present a reversible and topologically correct construction of a polyhedron from a binary object. The proposed algorithm is based on a Marching Cubes...
David Coeurjolly, Florent Dupont, Laurent Jospin, ...