Sciweavers

2968 search results - page 293 / 594
» Network Programming Using PLAN
Sort
View
EGOV
2003
Springer
15 years 9 months ago
Implementing e-Government in Spain
: New information and communication technologies within the Administration give rise to a series of important challenges: to select and use the various telematic and computer-relat...
José Luis Bermejo Latre
140
Voted
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 10 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ISI
2008
Springer
15 years 3 months ago
Intrusion activity projection for cyber situational awareness
Previous works in the area of network security have emphasized the creation of Intrusion Detection Systems (IDSs) to flag malicious network traffic and computer usage. Raw IDS data...
S. J. Yang, S. Byers, J. Holsopple, B. Argauer, D....
JMLR
2008
209views more  JMLR 2008»
15 years 3 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
DPD
2010
153views more  DPD 2010»
15 years 1 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl