2252 search results - page 47 / 451 » Lower Bounds for Dynamic Algorithms |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
ECCC
2010
13 years 7 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...