Sciweavers

96 search results - page 8 / 20
» On Implicate Discovery and Query Optimization
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
DEXAW
2005
IEEE
133views Database» more  DEXAW 2005»
13 years 10 months ago
Inductive Databases: Towards a New Generation of Databases for Knowledge Discovery
Data mining applications are typically used in the decision making process. The Knowledge Discovery Process (KDD process for short) is a typical iterative process, in which not on...
Rosa Meo
ADVIS
2004
Springer
14 years 2 months ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 10 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
INFOCOM
2005
IEEE
14 years 2 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann