Sciweavers

4536 search results - page 160 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 1 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
KDD
1997
ACM
114views Data Mining» more  KDD 1997»
14 years 1 months ago
Schema Discovery for Semistructured Data
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
Ke Wang, Huiqing Liu
ICCV
2001
IEEE
14 years 11 months ago
Real-Time Tracking of Highly Articulated Structures in the Presence of Noisy Measurements
This paper presents a novel approach for model-based realtime tracking of highly articulated structures such as humans. This approach is based on an algorithm which efficiently pr...
Tom Drummond, Roberto Cipolla
NIPS
2007
13 years 10 months ago
A Spectral Regularization Framework for Multi-Task Structure Learning
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
IICAI
2003
13 years 10 months ago
Performance Analysis of an Acyclic Genetic approach to Learn Bayesian Network Structure
Abstract. We introduce a new genetic algorithm approach for learning a Bayesian network structure from data. Our method is capable of learning over all node orderings and structure...
Pankaj B. Gupta, Vicki H. Allan