Sciweavers

1106 search results - page 42 / 222
» On regularization algorithms in learning theory
Sort
View
RECOMB
2000
Springer
15 years 8 months ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 10 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley
FASE
2008
Springer
15 years 6 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
CVPR
2004
IEEE
16 years 6 months ago
High-Zoom Video Hallucination by Exploiting Spatio-Temporal Regularities
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
Göksel Dedeoglu, Jonas August, Takeo Kanade
CIS
2005
Springer
15 years 10 months ago
Two Adaptive Matching Learning Algorithms for Independent Component Analysis
Independent component analysis (ICA) has been applied in many fields of signal processing and many ICA learning algorithms have been proposed from different perspectives. However...
Jinwen Ma, Fei Ge, Dengpan Gao