21342 search results - page 3990 / 4269 » A Structured Language Model |
148
click to vote
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
131
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
115
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
137
Voted
MM
2004
ACM
15 years 8 months ago
2004
ACM
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
117
click to vote
SIGIR
2004
ACM
15 years 8 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...