Sciweavers

163 search results - page 26 / 33
» Tight Approximability Results for Test Set Problems in Bioin...
Sort
View
ICLP
1997
Springer
13 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
TASLP
2008
126views more  TASLP 2008»
13 years 7 months ago
LyricAlly: Automatic Synchronization of Textual Lyrics to Acoustic Music Signals
We present LyricAlly, a prototype that automatically aligns acoustic musical signals with their corresponding textual lyrics, in a manner similar to manually-aligned karaoke. We ta...
Min-Yen Kan, Ye Wang, Denny Iskandar, Tin Lay Nwe,...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CEC
2009
IEEE
14 years 2 months ago
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
—Multi-objective optimization is an essential and challenging topic in the domains of engineering and computation because real-world problems usually include several conflicting...
Chih-Ming Chen, Ying-Ping Chen, Qingfu Zhang
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder