Sciweavers

7773 search results - page 17 / 1555
» On generalized Frame-Stewart numbers
Sort
View
MM
2005
ACM
172views Multimedia» more  MM 2005»
14 years 1 months ago
Learning the semantics of multimedia queries and concepts from a small number of examples
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
Apostol Natsev, Milind R. Naphade, Jelena Tesic
MFCS
2004
Springer
14 years 29 days ago
A Generalization of Repetition Threshold
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...
Lucian Ilie, Pascal Ochem, Jeffrey Shallit
DM
2000
158views more  DM 2000»
13 years 7 months ago
Bipartite Ramsey numbers and Zarankiewicz numbers
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...
CVPR
2003
IEEE
14 years 9 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
FOCS
2006
IEEE
14 years 1 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner