Sciweavers

270 search results - page 31 / 54
» Partitioning into Sets of Bounded Cardinality
Sort
View
FOGA
2011
13 years 7 days ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
ICCV
2003
IEEE
14 years 10 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
DIAGRAMS
2004
Springer
14 years 2 months ago
Reasoning with Projected Contours
Projected contours enable Euler diagrams to scale better. They enable the representation of information using less syntax and can therefore increase visual clarity. Here informal r...
Chris John
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 7 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
14 years 2 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat