Sciweavers

430 search results - page 39 / 86
» A New Linearizing Restriction in the Pattern Matching Proble...
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 8 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 8 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
IJFCS
2008
110views more  IJFCS 2008»
13 years 8 months ago
Indexing Gapped-Factors Using a Tree
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
Pierre Peterlongo, Julien Allali, Marie-France Sag...
TSMC
2008
182views more  TSMC 2008»
13 years 7 months ago
Incremental Linear Discriminant Analysis for Face Recognition
Abstract--Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant...
Haitao Zhao, Pong Chi Yuen
NC
2010
137views Neural Networks» more  NC 2010»
13 years 2 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...