Sciweavers

4962 search results - page 951 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 2 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 2 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
DEBU
2010
180views more  DEBU 2010»
15 years 2 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 1 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
ACSAC
1998
IEEE
15 years 6 months ago
Detecting Anomalous and Unknown Intrusions Against Programs
The ubiquity of the Internet connection to desktops has been both boon to business as well as cause for concern for the security of digital assets that may be unknowingly exposed....
Anup K. Gosh, James Wanken, Frank Charron