8196 search results - page 181 / 1640 » Computational Modeling and Complexity Science |
201
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
176
click to vote
GI
2009
Springer
15 years 10 months ago
2009
Springer
: Large traffic network systems require handling huge amounts of data, often distributed over a large geographical region in space and time. Centralised processing is not then the ...
178
click to vote
PKC
2010
Springer
15 years 8 months ago
2010
Springer
ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguye...
253
click to vote
Publication
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
157
click to vote
COLING
1992
15 years 7 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...