Sciweavers

4378 search results - page 76 / 876
» On the Complexity of Ordered Colourings
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 10 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
ICCV
2005
IEEE
14 years 2 months ago
Visual Learning Given Sparse Data of Unknown Complexity
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
Tao Xiang, Shaogang Gong
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
14 years 2 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
14 years 10 months ago
Detecting Duplicates in Complex XML Data
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
Melanie Weis, Felix Naumann
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
14 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