Sciweavers

96 search results - page 12 / 20
» Improved Algorithms for Approximate String Matching (Extende...
Sort
View
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 4 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
RIAO
2007
14 years 11 months ago
Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences
Abstract: Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity general...
Pierre Hanna, Pascal Ferraro
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
TSP
2008
99views more  TSP 2008»
14 years 9 months ago
An ABORT-Like Detector With Improved Mismatched Signals Rejection Capabilities
Abstract--In this paper we present a GLRT-based adaptive detection algorithm for extended targets with improved rejection capabilities of mismatched signals. We assume that a set o...
Francesco Bandiera, Olivier Besson, Giuseppe Ricci
ICALP
2009
Springer
15 years 10 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...