587 search results - page 40 / 118 » On the Relative Sizes of Learnable Sets |
DM
2002
13 years 8 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
ICASSP
2011
IEEE
13 years 12 days ago
2011
IEEE
Here we propose a sentence-generation method using templates that can be applied to create a speech database. This method requires the recording of a relatively small sentence set...
CLEF
2011
Springer
12 years 8 months ago
2011
Springer
Abstract In this paper, we describe a novel approach to intrinsic plagiarism detection. Each suspicious document is divided into a series of consecutive, potentially overlapping â€...
STOC
1990
ACM
14 years 22 days ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
PVLDB
2010
13 years 7 months ago
2010
We describe an automatic database design tool that exploits correlations between attributes when recommending materialized views (MVs) and indexes. Although there is a substantial...