Sciweavers

11740 search results - page 404 / 2348
» More Problems in Rewriting
Sort
View
PKDD
2010
Springer
125views Data Mining» more  PKDD 2010»
15 years 4 months ago
NDPMine: Efficiently Mining Discriminative Numerical Features for Pattern-Based Classification
Abstract. Pattern-based classification has demonstrated its power in recent studies, but because the cost of mining discriminative patterns as features in classification is very ex...
Hyungsul Kim, Sangkyum Kim, Tim Weninger, Jiawei H...
FUIN
2010
102views more  FUIN 2010»
15 years 4 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
AAAI
2011
14 years 6 months ago
Multi-Observation Sensor Resetting Localization with Ambiguous Landmarks
Successful approaches to the robot localization problem include Monte Carlo particle filters, which estimate non-parametric localization belief distributions. However, particle ...
Brian Coltin, Manuela M. Veloso
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 6 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 5 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...