Sciweavers

1332 search results - page 42 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
110
Voted
LCN
2007
IEEE
15 years 9 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
148
Voted
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 3 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
125
Voted
CIBCB
2006
IEEE
15 years 7 months ago
Efficient Probe Selection in Microarray Design
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence...
130
Voted
AAAI
2007
15 years 5 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 3 months ago
Approximation Algorithms for Shortest Descending Paths in Terrains
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw...