Sciweavers

219 search results - page 19 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
ATAL
2008
Springer
13 years 9 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
COMPGEOM
2007
ACM
13 years 11 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
13 years 11 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
NOSSDAV
1995
Springer
13 years 11 months ago
Meeting Arbitrary QoS Constraints Using Dynamic Rate Shaping of Coded Digital Video
Abstract. We introduce the concept of Dynamic Rate Shaping, a technique to adapt the rate ofcompressed video bitstreams MPEG-1, MPEG2, H.261, as well as JPEG to dynamically varyi...
Alexandros Eleftheriadis, Dimitris Anastassiou
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 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