Sciweavers

2434 search results - page 15 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 3 months ago
Using Multi-hypothesis Mapping to close Loops in Complex Cyclic Environments
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
Haris Baltzakis, Panos E. Trahanias
AAAI
2011
13 years 9 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 9 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
AAAI
2006
14 years 11 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
15 years 3 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek