Sciweavers

447 search results - page 60 / 90
» Approximation Algorithms for Directed Steiner Problems
Sort
View
DCOSS
2008
Springer
15 years 3 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
IJCAI
1997
15 years 2 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»
15 years 1 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
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 6 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
PODS
2004
ACM
148views Database» more  PODS 2004»
16 years 1 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar