Sciweavers

1672 search results - page 232 / 335
» Optimizing Monitoring Queries over Distributed Data
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICPPW
2009
IEEE
15 years 4 months ago
A Scalable Parallel Approach for Peptide Identification from Large-Scale Mass Spectrometry Data
Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular appr...
Gaurav Ramesh Kulkarni, Ananth Kalyanaraman, Willi...
KDD
2006
ACM
172views Data Mining» more  KDD 2006»
16 years 6 months ago
Attack detection in time series for recommender systems
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
Sheng Zhang, Amit Chakrabarti, James Ford, Fillia ...
GCA
2008
15 years 7 months ago
Network-aware Peer-to-Peer Based Grid Inter-Domain Scheduling
Grid technologies have enabled the aggregation of geographically distributed resources, in the context of a particular application. The network remains an important requirement for...
Agustín C. Caminero, Omer F. Rana, Blanca C...
IGARSS
2009
15 years 4 months ago
General Framework on Change Detection in a Sparse Domain
The paper presents a general framework for change detection in radar images, for an operational purpose and in the context of environmental monitoring. This framework is based on ...
Abdourrahmane M. Atto, Grégoire Mercier, Do...