768 search results - page 113 / 154 » Asymptotic Cellular Complexity |
108
click to vote
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
107
click to vote
CISC
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
101
Voted
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
119
click to vote
DAGSTUHL
2004
15 years 2 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...