Sciweavers

1632 search results - page 201 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 8 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
ICDE
2002
IEEE
175views Database» more  ICDE 2002»
16 years 5 months ago
Detecting Changes in XML Documents
We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses ca...
Gregory Cobena, Serge Abiteboul, Amélie Mar...
ICPR
2008
IEEE
16 years 5 months ago
Fuzzy rule selection using Iterative Rule Learning for speech data classification
Fuzzy rule base systems have been successfully used for pattern classification. These systems focus on generating a rule-base from numerical input data. The resulting rule-base ca...
Bin Ma, Chng Eng Siong, Haizhou Li, Omid Dehzangi
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 10 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...