2150 search results - page 199 / 430 » On a restricted cross-intersection problem |
142
click to vote
TCS
2008
15 years 4 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
136
click to vote
TKDE
2008
15 years 4 months ago
2008
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
125
click to vote
TNN
2008
15 years 4 months ago
2008
Separation of speech mixtures, often referred to as the cocktail party problem, has been studied for decades. In many source separation tasks, the separation method is limited by t...
134
Voted
JCT
2007
15 years 4 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
114
Voted
JDA
2007
15 years 4 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...