Sciweavers

3528 search results - page 452 / 706
» A New Approach to Planning in Networks
Sort
View
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
NN
2000
Springer
159views Neural Networks» more  NN 2000»
15 years 6 months ago
Independent component analysis for noisy data -- MEG data analysis
ICA (independent component analysis) is a new, simple and powerful idea for analyzing multi-variant data. One of the successful applications is neurobiological data analysis such ...
Shiro Ikeda, Keisuke Toyama
PAM
2009
Springer
16 years 1 months ago
PBS: Periodic Behavioral Spectrum of P2P Applications
Abstract. Due to the significant increase of peer-to-peer (P2P) traffic in the past few years, more attentions are put on designing effective methodologies of monitoring and ide...
Tom Z. J. Fu, Yan Hu, Xingang Shi, Dah-Ming Chiu, ...
DSN
2009
IEEE
16 years 1 months ago
Verme: Worm containment in overlay networks
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
Filipe Freitas, Edgar Marques, Rodrigo Rodrigues, ...
ICPADS
2008
IEEE
16 years 1 months ago
UDB: Using Directional Beacons for Localization in Underwater Sensor Networks
Underwater Sensor Networks (UWSN) are widely used in many applications, such as oceanic resource exploration, pollution monitoring, tsunami warnings and mine reconnaissance. In UW...
Hanjiang Luo, Yiyang Zhao, Zhongwen Guo, Siyuan Li...