Sciweavers

9842 search results - page 1462 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
188
Voted
KI
2007
Springer
16 years 1 months ago
Training on the Job - Collecting Experience with Hierarchical Hybrid Automata
We propose a novel approach to experience collection for autonomous service robots performing complex activities. This approach enables robots to data for many learning problems at...
Alexandra Kirsch, Michael Beetz
LPAR
2007
Springer
16 years 1 months ago
Decidable Fragments of Many-Sorted Logic
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
OTM
2007
Springer
16 years 1 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
PKDD
2007
Springer
130views Data Mining» more  PKDD 2007»
16 years 1 months ago
Discovering Emerging Patterns in Spatial Databases: A Multi-relational Approach
Abstract. Spatial Data Mining (SDM) has great potential in supporting public policy and in underpinning society functioning. One task in SDM is the discovery of characterization an...
Michelangelo Ceci, Annalisa Appice, Donato Malerba
« Prev « First page 1462 / 1969 Last » Next »