Sciweavers

1760 search results - page 230 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
STACS
2010
Springer
14 years 2 months ago
Finding Induced Subgraphs via Minimal Triangulations
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
Fedor V. Fomin, Yngve Villanger
ATAL
2004
Springer
14 years 1 months ago
A Planner-Independent Collaborative Planning Assistant
This article introduces a novel approach to the problem of collaborative planning. We present a method that takes classical one-shot planning techniques - that take a fixed set of...
Hyeok-Soo Kim, Jonathan Gratch
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 14 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
WSCG
2003
327views more  WSCG 2003»
13 years 9 months ago
Image Recoloring Induced by Palette Color Associations
In this paper we present a non-interactive method for recoloring a destination image according to the color scheme found in a source image. The approach is motivated by trying to ...
G. R. Greenfield, D. H. House
AROBOTS
2008
77views more  AROBOTS 2008»
13 years 8 months ago
Extending obstacle avoidance methods through multiple parameter-space transformations
Obstacle avoidance methods approach the problem of mobile robot autonomous navigation by steering the robot in real-time according to the most recent sensor readings, being suitab...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...