16091 search results - page 417 / 3219 » Solving |
186
click to vote
ICCSA
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
162
click to vote
LATIN
2004
Springer
16 years 4 days ago
2004
Springer
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
167
click to vote
LOPSTR
2004
Springer
16 years 4 days ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
177
click to vote
PAKDD
2004
ACM
16 years 4 days ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
184
click to vote
SAT
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...