7197 search results - page 91 / 1440 » On the computational power of BlenX |
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
Background subtraction is a crucial step in many automatic video content analysis applications. While numerous acceptable techniques have been proposed so far for background extra...
GROUP
2009
ACM
14 years 4 months ago
2009
ACM
Open content web sites depend on users to produce information of value. Wikipedia is the largest and most well-known such site. Previous work has shown that a small fraction of ed...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
ICCV
2007
IEEE
14 years 4 months ago
2007
IEEE
We investigate the problem of learning optimal descriptors for a given classification task. Many hand-crafted descriptors have been proposed in the literature for measuring visua...