Sciweavers

498 search results - page 38 / 100
» Experimental comparison of the two Fredman-Khachiyan-algorit...
Sort
View
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 7 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
ICMCS
2006
IEEE
90views Multimedia» more  ICMCS 2006»
15 years 7 months ago
Fast Video Object Selection for Interactive Television
In this paper, we study the problem of the fast selection of video objects, as an aid for the efficient semi-automatic annotation of video programs. In a regular system, the user ...
Rémi Trichet, Bernard Mérialdo
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
15 years 7 months ago
Multi-Robot Motion Planning by Incremental Coordination
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...
Mitul Saha, Pekka Isto
SAC
2006
ACM
15 years 7 months ago
Discretization from data streams: applications to histograms and data mining
Abstract. In this paper we propose a new method to perform incremental discretization. The basic idea is to perform the task in two layers. The first layer receives the sequence o...
João Gama, Carlos Pinto
CIMCA
2005
IEEE
15 years 7 months ago
Independent Nearest Features Memory-Based Classifier
The classification task is one of the most important problems in the area of data mining. In this paper we propose a new algorithm for addressing this problem. The main idea deriv...
Christos Pateritsas, Andreas Stafylopatis