Sciweavers

10407 search results - page 1961 / 2082
» Market-Based Approaches to Optimization
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 6 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ICALP
2009
Springer
16 years 6 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
HPCC
2011
Springer
14 years 5 months ago
Achieving Performance and Availability Guarantees with Spot Instances
Abstract—In the Infrastructure-as-a-Service (IaaS) cloud computing market, spot instances refer to virtual servers that are rented via an auction. Spot instances allow IaaS provi...
Michele Mazzucco, Marlon Dumas
CVPR
2009
IEEE
1351views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Support Vector Machines in Face Recognition with Occlusions
Support Vector Machines (SVM) are one of the most useful techniques in classification problems. One clear example is face recognition. However, SVM cannot be applied when the fe...
Aleix M. Martínez, Hongjun Jia
« Prev « First page 1961 / 2082 Last » Next »