3894 search results - page 329 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
214
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
140
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
310
Voted
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
272
Voted
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...