3020 search results - page 540 / 604 » Optimal partition trees |
132
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
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...
126
click to vote
WEBDB
2009
Springer
15 years 10 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
133
click to vote
FC
2009
Springer
15 years 10 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
118
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents a genetic programming-based symbolic regression approach to the construction of relational features in link analysis applications. Specifically, we consider t...
157
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...