9997 search results - page 1779 / 2000 » The case for crowd computing |
188
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
176
click to vote
ICS
2007
Tsinghua U.
16 years 23 days ago
2007
Tsinghua U.
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...
172
click to vote
IPSN
2007
Springer
16 years 23 days ago
2007
Springer
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
201
click to vote
IPSN
2007
Springer
16 years 23 days ago
2007
Springer
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
195
click to vote
ISAAC
2007
Springer
16 years 23 days ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...