2168 search results - page 294 / 434 » Randomized Algorithms and Complexity Theory |
147
click to vote
ATAL
1997
Springer
15 years 7 months ago
1997
Springer
Incorporating coalition formation algorithms into agent systems shall be advantageous due to the consequent increase in the overall quality of task performance. Coalition formatio...
118
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
139
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
93
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
133
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...