996 search results - page 64 / 200 » A general method to speed up fixed-parameter-tractable algor... |
142
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
163
Voted
AI
2002
Springer
15 years 4 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
260
click to vote
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
167
Voted
SIAMJO
2002
15 years 4 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
137
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...