Sciweavers

9842 search results - page 1440 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICIAP
2001
Springer
16 years 7 months ago
2D Shape Recognition by Hidden Markov Models
In Computer Vision, two-dimensional shape classifcation is a complex and well studied topic, often basic for three-dimensional object recognition. Object contours are a widely cho...
Manuele Bicego, Vittorio Murino
MOBISYS
2007
ACM
16 years 6 months ago
Context-aware access to public shared devices
To allow for an efficient usage of a device in pervasive computing environments, reliable and yet convenient user access is an important requirement. The problem becomes more comp...
David Jea, Ian Yap, Mani B. Srivastava
DCC
2006
IEEE
16 years 6 months ago
On Compressibility of Protein Sequences
We consider the problem of compressibility of protein sequences. Based on an observed genome-scale long-range correlation in concatenated protein sequences from different organism...
Donald A. Adjeroh, Fei Nan
ALT
2002
Springer
16 years 4 months ago
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
Johannes Fürnkranz
ICCD
2008
IEEE
139views Hardware» more  ICCD 2008»
16 years 4 months ago
Probabilistic error propagation in logic circuits using the Boolean difference calculus
- A gate level probabilistic error propagation model is presented which takes as input the Boolean function of the gate, the signal and error probabilities of the gate inputs, and ...
Nasir Mohyuddin, Ehsan Pakbaznia, Massoud Pedram
« Prev « First page 1440 / 1969 Last » Next »