Sciweavers

2365 search results - page 58 / 473
» All things are connected
Sort
View
CLUSTER
2007
IEEE
15 years 1 months ago
Anonymous communications in the Internet
With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is t...
Arjan Durresi
MSCS
2010
103views more  MSCS 2010»
14 years 11 months ago
Iterative reflections of monads
Iterative monads, introduced by Calvin Elgot in the 1970’s, are those ideal monads in which every guarded system of recursive equations has a unique solution. For every ideal mon...
Jirí Adámek, Stefan Milius, Jiri Vel...
LREC
2010
126views Education» more  LREC 2010»
15 years 2 months ago
Exploiting Scope for Shallow Discourse Parsing
We present an approach to automatically identifying the arguments of discourse connectives based on data from the Penn Discourse Treebank. Of the two arguments of connectives, cal...
Rashmi Prasad, Aravind K. Joshi, Bonnie L. Webber
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
15 years 5 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
INFOCOM
2002
IEEE
15 years 6 months ago
Beyond Routing: An Algebraic Approach to Network Coding
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...
Muriel Médard, Ralf Koetter