Sciweavers

1086 search results - page 97 / 218
» Jug measuring: Algorithms and complexity
Sort
View
JCST
2006
65views more  JCST 2006»
14 years 9 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
ICIP
2005
IEEE
15 years 11 months ago
Efficient local reflectional symmetries detection
In this paper, we present a novel framework for efficient multiple reflectional symmetric regions detection in real images. First, we present a fast operator to measure the symmetr...
Tianqiang Yuan, Xiaoou Tang
IDEAL
2004
Springer
15 years 3 months ago
Wrapper for Ranking Feature Selection
We propose a new feature selection criterion not based on calculated measures between attributes, or complex and costly distance calculations. Applying a wrapper to the output of a...
Roberto Ruiz, Jesús S. Aguilar-Ruiz, Jos&ea...
FORMATS
2003
Springer
15 years 3 months ago
Discrete-Time Rewards Model-Checked
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
Suzana Andova, Holger Hermanns, Joost-Pieter Katoe...
CVPR
2000
IEEE
15 years 11 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi