Sciweavers

101 search results - page 2 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 5 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
13 years 8 months ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
3DPVT
2006
IEEE
229views Visualization» more  3DPVT 2006»
13 years 8 months ago
Fast and Efficient Dense Variational Stereo on GPU
Thanks to their high performance and programmability, the latest graphics cards can now be used for scientific purpose. They are indeed very efficient parallel Single Instruction ...
Julien Mairal, Renaud Keriven, Alexandre Chariot
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICCV
2009
IEEE
13 years 2 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden