2180 search results - page 289 / 436 » Algorithms for discovering bucket orders from data |
127
click to vote
ICONIP
2007
15 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
367
click to vote
ICDE
2000
IEEE
16 years 6 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
150
click to vote
SCCC
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target on peer to peer systems and its capability to di...
116
click to vote
CGF
2004
15 years 4 months ago
2004
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
153
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...