10412 search results - page 242 / 2083 » The efficiency of algorithms - misconceptions |
132
Voted
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
101
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
133
click to vote
NAACL
2010
15 years 1 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
157
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introd...
116
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a new and low-cost approach for identifying sequentially untestable faults. Unlike the single fault theorem, where the stuck-at fault is injected only in the r...