Sciweavers

6582 search results - page 142 / 1317
» The focus of attention problem
Sort
View
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 12 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
CORR
2011
Springer
220views Education» more  CORR 2011»
15 years 1 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
15 years 6 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
KDD
1997
ACM
96views Data Mining» more  KDD 1997»
15 years 10 months ago
Mining Association Rules with Item Constraints
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice...
Ramakrishnan Srikant, Quoc Vu, Rakesh Agrawal
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 6 months ago
A New Trend in Optimization on Multi Overcomplete Dictionary toward Inpainting
1 Recently, great attention was intended toward overcomplete dictionaries and the sparse representations they can provide. In a wide variety of signal processing problems, sparsity...
Seyyed Majid Valiollahzadeh, Mohammad Nazari, Mass...