Sciweavers

960 search results - page 167 / 192
» Sharing work in keyword search over databases
Sort
View
KBSE
2010
IEEE
14 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
15 years 10 months ago
A framework for classification and segmentation of massive audio data streams
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
Charu C. Aggarwal
HPDC
2010
IEEE
14 years 11 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
13 years 6 days ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà