Sciweavers

2834 search results - page 54 / 567
» A Probabilistic Approach to Measuring Robustness in Computin...
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 1 months ago
Anytime Measures for Top-k Algorithms
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
ESORICS
2010
Springer
13 years 8 months ago
D(e|i)aling with VoIP: Robust Prevention of DIAL Attacks
We carry out attacks using Internet services that aim to keep telephone devices busy, hindering legitimate callers from gaining access. We use the term DIAL (Digitally Initiated A...
Alexandros Kapravelos, Iasonas Polakis, Elias Atha...
CVPR
2012
IEEE
11 years 10 months ago
From pixels to physics: Probabilistic color de-rendering
Consumer digital cameras use tone-mapping to produce compact, narrow-gamut images that are nonetheless visually pleasing. In doing so, they discard or distort substantial radiomet...
Ying Xiong, Kate Saenko, Trevor Darrell, Todd Zick...
WWW
2005
ACM
14 years 1 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
KDD
1998
ACM
181views Data Mining» more  KDD 1998»
13 years 12 months ago
Approaches to Online Learning and Concept Drift for User Identification in Computer Security
The task in the computer security domain of anomaly detection is to characterize the behaviors of a computer user (the `valid', or `normal' user) so that unusual occurre...
Terran Lane, Carla E. Brodley