21324 search results - page 3883 / 4265 » Making the case for computing |
151
click to vote
ICALP
2007
Springer
15 years 10 months 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...
134
click to vote
ICS
2007
Tsinghua U.
15 years 10 months 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...
160
click to vote
IPSN
2007
Springer
15 years 10 months 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...
154
click to vote
ISAAC
2007
Springer
15 years 10 months 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...
139
click to vote
PAM
2007
Springer
15 years 10 months ago
2007
Springer
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...