Sciweavers

76 search results - page 13 / 16
» Linear-Time Ranking of Permutations
Sort
View
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
14 years 26 days ago
Full-custom CMOS realization of a high-performance binary sorting engine with linear area-time complexity
The full-custom CMOS realization of a new modular sorting architecture is presented. The high-performance architecture is based on rank ordering, and on efficient implementation o...
Turan Demirci, Ilhan Hatirnaz, Yusuf Leblebici
ENVSOFT
2006
125views more  ENVSOFT 2006»
13 years 7 months ago
Sensitivity analysis based on regional splits and regression trees (SARS-RT)
A global sensitivity analysis with regional properties is introduced. This method is demonstrated on two synthetic and one hydraulic example. It can be shown that an uncertainty a...
Florian Pappenberger, Ion Iorgulescu, Keith J. Bev...
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 20 days ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
CVPR
1997
IEEE
13 years 11 months ago
Motion estimation using ordinal measures
Wepresent a methodfor motion estimation using ordinal measures. Ordinal measures are based on relative ordering of intensity values in a image regioncalled rankpermutation. While ...
Dinkar N. Bhat, Shree K. Nayar, Alok Gupta
ANLP
1994
105views more  ANLP 1994»
13 years 9 months ago
Modeling Content Identification from Document Images
A new technique to locate content-representing words for a given document image using representation of character shapes is described. A character shape code representation define...
Takehiro Nakayama