Sciweavers

393 search results - page 48 / 79
» Approximation Algorithm for Directed Telephone Multicast Pro...
Sort
View
DISOPT
2008
107views more  DISOPT 2008»
13 years 7 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
DCOSS
2008
Springer
13 years 9 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
IWCMC
2006
ACM
14 years 1 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
IJCAI
1997
13 years 8 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto
VC
2008
132views more  VC 2008»
13 years 7 months ago
Caustic spot light for rendering caustics
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...
Xinguo Liu, Zhao Dong, Hujun Bao, Qunsheng Peng