380 search results - page 10 / 76 » A Categorical Setting for Lower Complexity |
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
105
click to vote
JOC
2008
14 years 11 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
108
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ISCAS
2005
IEEE
15 years 5 months ago
2005
IEEE
—Adaptive systems have been broadly used in a wide range of applications and can be categorized into linear or nonlinear adaptive systems. Unfortunately, hardware complexity for ...
114
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...