Sciweavers

2859 search results - page 470 / 572
» Querying Complex Structured Databases
Sort
View
KAIS
2006
110views more  KAIS 2006»
13 years 8 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
14 years 9 months ago
A Sampling-Based Approach to Information Recovery
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. For example, in sens...
Junyi Xie, Jun Yang 0001, Yuguo Chen, Haixun Wang,...
ICLP
2007
Springer
14 years 32 min ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 8 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 8 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...