Sciweavers

994 search results - page 72 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
133
Voted
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
16 years 7 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
123
Voted
CIKM
2009
Springer
15 years 7 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
UC
2009
Springer
15 years 7 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong
113
Voted
COMPGEOM
1994
ACM
15 years 4 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
69
Voted
ICPR
2008
IEEE
15 years 7 months ago
RANSAC-SVM for large-scale datasets
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...
Kenji Watanabe, Takio Kurita