1068 search results - page 183 / 214 » On Space Bounded Server Algorithms |
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Among image restoration literature, there are mainly two kinds of approach. One is based on a process over image wavelet coefficients, as wavelet shrinkage for denoising. The other...
GIS
2006
ACM
14 years 9 months ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
STOC
2010
ACM
14 years 12 days ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...