Sciweavers

3192 search results - page 362 / 639
» The minimum latency problem
Sort
View
PODS
2009
ACM
110views Database» more  PODS 2009»
16 years 5 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
RECOMB
2006
Springer
16 years 4 months ago
Inferring Positional Homologs with Common Intervals of Sequences
Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new appr...
Guillaume Blin, Annie Chateau, Cedric Chauve, Yann...
IPPS
2009
IEEE
15 years 11 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
15 years 11 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
IWOCA
2009
Springer
153views Algorithms» more  IWOCA 2009»
15 years 11 months ago
Feedback Vertex Set on Graphs of Low Cliquewidth
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...