Sciweavers

4536 search results - page 509 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
NIPS
2003
15 years 8 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 7 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
ROMAN
2007
IEEE
127views Robotics» more  ROMAN 2007»
16 years 1 months ago
Incremental on-line hierarchical clustering of whole body motion patterns
Abstract— This paper describes a novel algorithm for autonomous and incremental learning of motion pattern primitives by observation of human motion. Human motion patterns are ed...
Dana Kulic, Wataru Takano, Yoshihiko Nakamura
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 12 months ago
Automatic Web Page Classification in a Dynamic and Hierarchical Way
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification...
Xiaogang Peng, Ben Choi