Sciweavers

148 search results - page 13 / 30
» Linear Time Algorithm for the Longest Common Repeat Problem
Sort
View
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 8 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
AIRS
2004
Springer
14 years 1 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 9 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
ICDM
2008
IEEE
128views Data Mining» more  ICDM 2008»
14 years 2 months ago
Cost-Sensitive Parsimonious Linear Regression
We examine linear regression problems where some features may only be observable at a cost (e.g., in medical domains where features may correspond to diagnostic tests that take ti...
Robby Goetschalckx, Kurt Driessens, Scott Sanner
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 9 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...