Sciweavers

1402 search results - page 160 / 281
» Sparse-Memory Graph Search
Sort
View
TCS
2008
15 years 2 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
140
Voted
ERCIMDL
2009
Springer
225views Education» more  ERCIMDL 2009»
15 years 9 months ago
Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...
René Bernd, Ina Blümel, Harald Krottma...
101
Voted
HT
2009
ACM
15 years 9 months ago
Comparing the performance of us college football teams in the web and on the field
In previous research it has been shown that link-based web page metrics can be used to predict experts’ assessment of quality. We are interested in a related question: do expert...
Martin Klein, Olena Hunsicker, Michael L. Nelson
129
Voted
COMCOM
2006
88views more  COMCOM 2006»
15 years 2 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
EOR
2006
57views more  EOR 2006»
15 years 2 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro