Sciweavers

432 search results - page 24 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
ORL
2000
77views more  ORL 2000»
13 years 8 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ICALP
2009
Springer
14 years 9 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 10 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
CVPR
2001
IEEE
14 years 10 months ago
A Bayesian Approach to Digital Matting
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel ...
Yung-Yu Chuang, Brian Curless, David Salesin, Rich...
ICCD
2004
IEEE
105views Hardware» more  ICCD 2004»
14 years 5 months ago
Circuit-Based Preprocessing of ILP and Its Applications in Leakage Minimization and Power Estimation
In this paper we discuss the application of circuit-based logical reasoning to simplify optimization problems expressed as integer linear programs (ILP) over circuit states. We de...
Donald Chai, Andreas Kuehlmann