Sciweavers

214 search results - page 43 / 43
» A linear time algorithm for L(2,1)-labeling of trees
Sort
View
ISCI
2007
130views more  ISCI 2007»
13 years 10 months ago
Learning to classify e-mail
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
Irena Koprinska, Josiah Poon, James Clark, Jason C...
RECOMB
2002
Springer
14 years 11 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
14 years 5 months ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
SIGMETRICS
2008
ACM
179views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Xengine: a fast and scalable XACML policy evaluation engine
XACML has become the de facto standard for specifying access control policies for various applications, especially web services. With the explosive growth of web applications depl...
Alex X. Liu, Fei Chen, JeeHyun Hwang, Tao Xie