Sciweavers

1529 search results - page 29 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 2 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
SIBGRAPI
2005
IEEE
14 years 1 months ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
AI
2005
Springer
13 years 7 months ago
Fast Protein Superfamily Classification Using Principal Component Null Space Analysis
Abstract. The protein family classification problem, which consists of determining the family memberships of given unknown protein sequences, is very important for a biologist for ...
Leon French, Alioune Ngom, Luis Rueda
TIP
2008
134views more  TIP 2008»
13 years 7 months ago
Higher Order SVD Analysis for Dynamic Texture Synthesis
Videos representing flames, water, smoke, etc. are often defined as dynamic textures: "textures" because they are characterized by redundant repetition of a pattern and &...
Roberto Costantini, Luciano Sbaiz, Sabine Süs...