Sciweavers

32 search results - page 4 / 7
» False Negative Problem of Counting Bloom Filter
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
14 years 11 days ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
ECCV
2010
Springer
14 years 27 days ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
CEAS
2007
Springer
14 years 1 months ago
Asymmetric Gradient Boosting with Application to Spam Filtering
In this paper, we propose a new asymmetric boosting method, Boosting with Different Costs. Traditional boosting methods assume the same cost for misclassified instances from di...
Jingrui He, Bo Thiesson
MICRO
2008
IEEE
118views Hardware» more  MICRO 2008»
14 years 1 months ago
Notary: Hardware techniques to enhance signatures
Hardware signatures have been recently proposed as an efficient mechanism to detect conflicts amongst concurrently running transactions in transactional memory systems (e.g., Bulk...
Luke Yen, Stark C. Draper, Mark D. Hill
IMC
2005
ACM
14 years 1 months ago
Combining Filtering and Statistical Methods for Anomaly Detection
In this work we develop an approach for anomaly detection for large scale networks such as that of an enterprize or an ISP. The traffic patterns we focus on for analysis are that...
Augustin Soule, Kavé Salamatian, Nina Taft