Sciweavers

789 search results - page 25 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
JMLR
2006
93views more  JMLR 2006»
13 years 7 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
CVPR
2001
IEEE
14 years 9 months ago
Efficient Computation of Adaptive Threshold Surfaces for Image Binarization
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
Ilya Blayvas, Alfred M. Bruckstein, Ron Kimmel
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 7 months ago
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...
AC
1998
Springer
13 years 7 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn