Sciweavers

1887 search results - page 17 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
WWW
2008
ACM
14 years 8 months ago
Efficient multi-keyword search over p2p web
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...
PPAM
2007
Springer
14 years 1 months ago
On Parallel Generation of Partial Derangements, Derangements and Permutations
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
Zbigniew Kokosinski
CP
2004
Springer
14 years 1 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
ICMCS
2005
IEEE
85views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Fast Search Method for Image Vector Quantization Based on Equal-Average Equal-Variance and Partial Sum Concept
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...
Zhibin Pan, Koji Kotani, Tadahiro Ohmi