Sciweavers

2745 search results - page 267 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
OOPSLA
1997
Springer
15 years 8 months ago
Efficient Type Inclusion Tests
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
Jan Vitek, R. Nigel Horspool, Andreas Krall
CIVR
2008
Springer
138views Image Analysis» more  CIVR 2008»
15 years 6 months ago
Visual islands: intuitive browsing of visual search results
The amount of available digital multimedia has seen exponential growth in recent years. While advances have been made in the indexing and searching of images and videos, less focu...
Eric Zavesky, Shih-Fu Chang, Cheng-Chih Yang
ICDAR
2009
IEEE
15 years 2 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
ICCAD
2005
IEEE
81views Hardware» more  ICCAD 2005»
16 years 1 months ago
Kauffman networks: analysis and applications
Abstract— A Kauffman network is an abstract model of gene regulatory networks. Each gene is represented by a vertex. An edge from one vertex to another implies that the former ge...
Elena Dubrova, Maxim Teslenko, Andrés Marti...
CVPR
2007
IEEE
16 years 6 months ago
ShadowCuts: Photometric Stereo with Shadows
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
Manmohan Krishna Chandraker, Sameer Agarwal, David...