339 search results - page 42 / 68 » Random Sampling Techniques in Parallel Computation |
102
click to vote
Publication
One of the principal bottlenecks in applying learning techniques to classification problems is the large amount of labeled training data required. Especially for images and video, ...
JMLR
2010
14 years 4 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
CGF
2008
14 years 9 months ago
2008
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
WAW
2007
Springer
15 years 3 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...