Sciweavers

246 search results - page 44 / 50
» Change Detection in a 3-d World
Sort
View
KDD
2007
ACM
137views Data Mining» more  KDD 2007»
14 years 9 months ago
Characterising the difference
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 3 months ago
Mining mutation chains in biological sequences
— The increasing infectious disease outbreaks has led to a need for new research to better understand the disease’s origins, epidemiological features and pathogenicity caused b...
Chang Sheng, Wynne Hsu, Mong-Li Lee, Joo Chuan Ton...
ATAL
1999
Springer
14 years 1 months ago
A Planning Component for RETSINA Agents
In the RETSINA multi-agent system, each agent is provided with an internal planning component—the RETSINA planner. Each agent, using its internal planner, formulates detailed pla...
Massimo Paolucci, Onn Shehory, Katia P. Sycara, Di...
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 8 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
DAGSTUHL
2006
13 years 10 months ago
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madr...