Sciweavers

1120 search results - page 174 / 224
» Parallel Algorithmic Techniques for Combinatorial Computatio...
Sort
View
ISPA
2005
Springer
14 years 1 months ago
COMPACT: A Comparative Package for Clustering Assessment
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...
Roy Varshavsky, Michal Linial, David Horn
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 2 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 2 months ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl
DALT
2008
Springer
13 years 9 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 2 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy