1511 search results - page 28 / 303 » Randomness, lowness and degrees |
171
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
196
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
172
click to vote
JSYML
2008
15 years 5 months ago
2008
Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say...
155
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
150
click to vote
SAC
2005
ACM
16 years 7 days ago
2005
ACM
Based on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a mathematical model of information retrieval based on a fuzzy ...