3466 search results - page 581 / 694 » Fast computation of special resultants |
259
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
169
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
207
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
187
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not ne...
180
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...