Sciweavers

281 search results - page 20 / 57
» Querying the Guarded Fragment
Sort
View
110
Voted
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
16 years 22 days ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
15 years 7 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
114
Voted
PODS
2008
ACM
120views Database» more  PODS 2008»
16 years 14 days ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
FOCS
1995
IEEE
15 years 3 months ago
Reconstructing Strings from Substrings in Rounds
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
Dimitris Margaritis, Steven Skiena
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 14 days ago
Buffering in query evaluation over XML streams
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski