4114 search results - page 144 / 823 » Efficient Algorithms for the 2-Center Problems |
162
click to vote
DAGSTUHL
2004
15 years 7 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...
161
click to vote
AAMAS
2005
Springer
15 years 6 months ago
2005
Springer
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
188
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
137
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...
112
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...