Sciweavers

459 search results - page 32 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
IUI
2006
ACM
15 years 5 months ago
Eye-tracking to model and adapt to user meta-cognition in intelligent learning environments
In this paper we describe research on using eye-tracking data for on-line assessment of user meta-cognitive behavior during the interaction with an intelligent learning environmen...
Christina Merten, Cristina Conati
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 6 days ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 12 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ECCC
2008
98views more  ECCC 2008»
14 years 12 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ISB
2002
140views more  ISB 2002»
14 years 11 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...