Sciweavers

1887 search results - page 43 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICCV
2009
IEEE
15 years 21 days ago
A Riemannian Analysis of 3D Nose Shapes For Partial Human Biometrics
In this paper we explore the use of shapes of noses for performing partial human biometrics. The basic idea is to represent nasal surfaces using indexed collections of isocurves,...
Hassen drira, Boulbaba Ben Amor, Anuj Srivastava, ...
TPDS
2008
124views more  TPDS 2008»
13 years 7 months ago
Efficient Breadth-First Search on the Cell/BE Processor
Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
CSCLP
2006
Springer
13 years 11 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ICIP
2005
IEEE
14 years 9 months ago
Interactive partial matching of video sequences in large collections
This paper addresses the problem of matching visual parts of video sequences from within a large collection. The visual content of a video sequence is described by the set of the ...
Eric Bruno, Nicolas Moënne-Loccoz, Sté...