Sciweavers

8413 search results - page 1194 / 1683
» Ordering Problem Subgoals
Sort
View
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 7 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
KDD
2009
ACM
217views Data Mining» more  KDD 2009»
16 years 7 months ago
Efficient anomaly monitoring over moving object trajectory streams
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
Yingyi Bu, Lei Chen 0002, Ada Wai-Chee Fu, Dawei L...
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 7 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 7 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
« Prev « First page 1194 / 1683 Last » Next »