13603 search results - page 2346 / 2721 » On the Complexity of Computing Treelength |
167
click to vote
TACS
1997
Springer
15 years 11 months ago
1997
Springer
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
243
click to vote
VLDB
1997
ACM
15 years 11 months ago
1997
ACM
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
211
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
204
click to vote
COLT
1993
Springer
15 years 11 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
181
click to vote
COMPGEOM
1993
ACM
15 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...