Sciweavers

2489 search results - page 232 / 498
» On the Subgroup Distance Problem
Sort
View
AAAI
2010
15 years 6 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
EVOW
2008
Springer
15 years 5 months ago
Discovering Several Robot Behaviors through Speciation
Abstract. This contribution studies speciation from the standpoint of evolutionary robotics (ER). A common approach to ER is to design a robot’s control system using neuro-evolut...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
127
Voted
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 4 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
DCG
2010
289views more  DCG 2010»
15 years 4 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
CIKM
2010
Springer
15 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...