6251 search results - page 243 / 1251 » Randomness, Computability, and Density |
145
Voted
ICML
1994
IEEE
15 years 8 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
111
Voted
SPDP
1991
IEEE
15 years 8 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
140
click to vote
AAAI
2007
15 years 6 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
126
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Recently, there has been increasing interests in applying aspect models (e.g., PLSA and LDA) in image segmentation. However, these models ignore spatial relationships amo...
143
click to vote
AISC
2008
Springer
15 years 6 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...