9997 search results - page 437 / 2000 » The case for crowd computing |
166
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
178
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
143
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
150
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
198
click to vote
CCECE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Most of the existing video streaming systems employ the worst case analysis in application layer buffer size dimensioning. Even though the worst case buffer size dimensioning p...