7106 search results - page 1144 / 1422 » Restricted Complexity, General Complexity |
193
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
180
click to vote
MST
2010
15 years 5 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
186
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Modern IDEs for object-oriented languages like Java provide support for a basic set of simple automated refactorings whose behaviour is easy to describe intuitively. It is, howeve...
218
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Consumer electronics today such as cell phones often have one or more low-power FPGAs to assist with energyintensive operations in order to reduce overall energy consumption and i...
188
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...