Sciweavers

2294 search results - page 311 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ECAI
2008
Springer
15 years 4 months ago
Reinforcement Learning with Classifier Selection for Focused Crawling
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
Ioannis Partalas, Georgios Paliouras, Ioannis P. V...
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
15 years 2 months ago
Generic uniform observability analysis for bilinear systems
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
T. Boukhobza
DISOPT
2010
132views more  DISOPT 2010»
15 years 2 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
VC
2008
94views more  VC 2008»
15 years 2 months ago
Virtual world explorations by using topological and semantic knowledge
This paper is dedicated to virtual world exploration techniques. Automatic camera control is important in many fields as computational geometry, visual servoing, robot motion, grap...
Dmitry Sokolov, Dimitri Plemenos
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
15 years 2 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...