Sciweavers

369 search results - page 70 / 74
» Fast Algorithms for the Generalized Foley-Sammon Discriminan...
Sort
View
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
BMCBI
2010
117views more  BMCBI 2010»
13 years 7 months ago
Automatic, context-specific generation of Gene Ontology slims
Background: The use of ontologies to control vocabulary and structure annotation has added value to genomescale data, and contributed to the capture and re-use of knowledge across...
Melissa J. Davis, Muhammad Shoaib B. Sehgal, Mark ...
CIKM
2011
Springer
12 years 7 months ago
Citation count prediction: learning to estimate future citations for literature
In most of the cases, scientists depend on previous literature which is relevant to their research fields for developing new ideas. However, it is not wise, nor possible, to trac...
Rui Yan, Jie Tang, Xiaobing Liu, Dongdong Shan, Xi...
KDD
2007
ACM
566views Data Mining» more  KDD 2007»
14 years 7 months ago
IMDS: intelligent malware detection system
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, ...
Yanfang Ye, Dingding Wang, Tao Li, Dongyi Ye
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 7 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...