Sciweavers

1914 search results - page 246 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 9 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
TASE
2010
IEEE
14 years 10 months ago
Optimization of Group Elevator Scheduling With Advance Information
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
Jin Sun, Qianchuan Zhao, Peter B. Luh
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 10 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
ICCV
2009
IEEE
1735views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Coded Aperture Pairs for Depth From Defocus
The classical approach to depth from defocus uses two images taken with circular apertures of different sizes. We show in this paper that the use of a circular aperture severely...
Changyin Zhou, Stephen Lin, Shree Nayar
ICCV
2009
IEEE
16 years 9 months 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, ...