Sciweavers

365 search results - page 5 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Action and Simultaneous Multiple-Person Identification Using Cubic Higher-Order Local Auto-Correlation
We propose a new method ? Cubic Higher-order Local Auto-Correlation (CHLAC) ? to address three-way data analysis. This method is a natural extension of Higherorder Local Auto-Corr...
Nobuyuki Otsu, Takumi Kobayashi
CONCUR
2009
Springer
14 years 1 months ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...
AI
2011
Springer
13 years 2 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
ECCV
2010
Springer
13 years 12 months ago
Partition Min-Hash for Partial Duplicate Image Discovery
In this paper, we propose Partition min-Hash (PmH), a novel hashing scheme for discovering partial duplicate images from a large database. Unlike the standard min-Hash algorithm th...
CVPR
2011
IEEE
13 years 3 months ago
From Partial Shape Matching through Local Deformation to Robust Global Shape Similarity for Object Detection
In this paper, we propose a novel framework for contour based object detection. Compared to previous work, our contribution is three-fold. 1) A novel shape matching scheme suitabl...
Tianyang Ma, LonginJan Latecki