Sciweavers

962 search results - page 29 / 193
» Some Reducibilities on Regular Sets
Sort
View
PAA
2007
13 years 7 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
13 years 7 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
SOFSEM
2012
Springer
12 years 3 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
SIAMJO
2002
99views more  SIAMJO 2002»
13 years 7 months ago
Active Sets, Nonsmoothness, and Sensitivity
Nonsmoothness pervades optimization, but the way it typically arises is highly structured. Nonsmooth behavior of an objective function is usually associated, locally, with an activ...
A. S. Lewis
SMILE
1998
Springer
13 years 12 months ago
Interactive 3D Modeling from Multiple Images Using Scene Regularities
Abstract. We present some recent progress in designing and implementing two interactive image-based 3D modeling systems. The first system constructs 3D models from a collection of ...
Heung-Yeung Shum, Richard Szeliski, Simon Baker, M...