2370 search results - page 53 / 474 » The Characterization of Data-Accumulating Algorithms |
DIMACS
2001
14 years 11 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
AIPS
2000
14 years 11 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
NIPS
1994
14 years 11 months ago
1994
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus ...
107
click to vote
WIRN
2005
Springer
15 years 3 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...