Sciweavers

477 search results - page 26 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
SIGIR
2006
ACM
14 years 3 months ago
Thread detection in dynamic text message streams
Text message stream is a newly emerging type of Web data which is produced in enormous quantities with the popularity of Instant Messaging and Internet Relay Chat. It is benefici...
Dou Shen, Qiang Yang, Jian-Tao Sun, Zheng Chen
IPPS
2005
IEEE
14 years 3 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
DMKD
2003
ACM
148views Data Mining» more  DMKD 2003»
14 years 3 months ago
A symbolic representation of time series, with implications for streaming algorithms
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Bil...
IS
2007
13 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 3 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà