6833 search results - page 411 / 1367 » Some two-character sets |
198
click to vote
EDBT
2009
ACM
16 years 7 days ago
2009
ACM
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...
283
click to vote
ICANN
2001
Springer
16 years 3 days ago
2001
Springer
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
201
click to vote
EUROCOLT
1999
Springer
15 years 12 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
187
click to vote
GIS
1999
ACM
15 years 12 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
197
click to vote
COLT
1998
Springer
15 years 12 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...