Sciweavers

5046 search results - page 869 / 1010
» Feature Selection from Huge Feature Sets
Sort
View
ICDCIT
2007
Springer
16 years 18 days ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...
ICLP
2007
Springer
16 years 18 days ago
Demand-Driven Indexing of Prolog Clauses
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
Vítor Santos Costa, Konstantinos F. Sagonas...
LOPSTR
2007
Springer
16 years 17 days ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
CVPR
2006
IEEE
16 years 15 days ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
ICRA
2006
IEEE
102views Robotics» more  ICRA 2006»
16 years 14 days ago
Fast Iterative Alignment of Pose Graphs with Poor Initial Estimates
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
Edwin Olson, John J. Leonard, Seth J. Teller