Sciweavers

5849 search results - page 99 / 1170
» Predictive search distributions
Sort
View
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
16 years 1 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
COMCOM
2006
88views more  COMCOM 2006»
15 years 6 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
SPIN
2001
Springer
15 years 11 months ago
Distributed LTL Model-Checking in SPIN
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...
Jiri Barnat, Lubos Brim, Jitka Stríbrn&aacu...
WISE
2002
Springer
15 years 11 months ago
An MDP-based Peer-to-Peer Search Server Network
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
Yipeng Shen, Dik Lun Lee
HPCA
1997
IEEE
15 years 11 months ago
Architectural Support for Compiler-Synthesized Dynamic Branch Prediction Strategies: Rationale and Initial Results
This paper introduces a new architectural approach that supports compiler-synthesized dynamic branch predication. In compiler-synthesized dynamic branch prediction, the compiler g...
David I. August, Daniel A. Connors, John C. Gyllen...