Sciweavers

1369 search results - page 111 / 274
» Lattice computations for random numbers
Sort
View
DAC
2002
ACM
16 years 6 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
DCC
2008
IEEE
16 years 5 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
IEEECGIV
2009
IEEE
16 years 13 days ago
Two Dimensional Compressive Classifier for Sparse Images
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
Armin Eftekhari, Hamid Abrishami Moghaddam, Massou...
ACCV
2009
Springer
16 years 12 days ago
Interactive Super-Resolution through Neighbor Embedding
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
Jian Pu, Junping Zhang, Peihong Guo, Xiaoru Yuan
164
Voted
ICTAI
2008
IEEE
16 years 6 days ago
An Incremental Hough Transform for Detecting Ellipses in Image Data Streams
In this paper, we present a purely incremental, scalable algorithm for the detection of elliptical shapes in images. Our method uses an incremental version of the Random Hough Tra...
Sofiane Sellah, Olfa Nasraoui