3020 search results - page 357 / 604 » Optimal partition trees |
149
click to vote
ASIACRYPT
2003
Springer
15 years 12 months ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
183
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
205
click to vote
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
198
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
207
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...