2605 search results - page 342 / 521 » The many levels of CSCL |
142
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a no...
127
click to vote
IJBC
2008
15 years 6 months ago
2008
Abstract-- In this paper, we propose a robust hyperchaotic system that is practically serviceable in digital securecommunication. The system consists of many coupled robust logisti...
143
click to vote
CN
2007
15 years 6 months ago
2007
—Interactivity in the transport protocol can greatly benefit transport friendly applications generating streaming traffic. Recently we have developed iTCP, which can provide even...
156
click to vote
IGPL
2006
15 years 6 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
159
click to vote
IJCV
2006
15 years 6 months ago
2006
In film production, it is sometimes not convenient or directly impossible to shoot some night scenes at night. The film budget, schedule or location may not allow it. In these cas...