Sciweavers

845 search results - page 50 / 169
» Complexity Dimensions and Learnability
Sort
View
ICCV
2003
IEEE
16 years 2 months ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
136
Voted
ECCV
2010
Springer
15 years 6 months ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
115
Voted
VLDB
1999
ACM
174views Database» more  VLDB 1999»
15 years 5 months ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
87
Voted
GECCO
2010
Springer
174views Optimization» more  GECCO 2010»
15 years 4 months ago
Real-coded genetic algorithm benchmarked on noiseless black-box optimization testbed
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
Thanh-Do Tran, Gang-Gyoo Jin
SIROCCO
2008
15 years 2 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau