Sciweavers

3082 search results - page 385 / 617
» New Bounds for the Controller Problem
Sort
View
IJDAR
2006
245views more  IJDAR 2006»
15 years 6 months ago
Object count/area graphs for the evaluation of object detection and segmentation algorithms
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
Christian Wolf, Jean-Michel Jolion
DAC
2004
ACM
16 years 7 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
214
Voted
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
16 years 6 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 12 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 10 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...