4112 search results - page 232 / 823 » Efficient Algorithms for the Spoonerism Problem |
211
click to vote
TCS
2010
15 years 1 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
163
click to vote
TIP
2010
15 years 1 months ago
2010
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...
280
click to vote
VLDB
2001
ACM
16 years 6 months ago
2001
ACM
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
165
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
205
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...