Sciweavers

186 search results - page 15 / 38
» Learning about Constraints by Reflection
Sort
View
WCRE
2007
IEEE
14 years 2 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke
AIMSA
2000
Springer
14 years 8 days ago
Maintaining a Jointly Constructed Student Model
Allowing the student to have some control over the diagnosis inspecting and changing the model the system has made of him is a feasible approach in student modelling which tracks t...
Vania Dimitrova, John A. Self, Paul Brna
FOCS
2008
IEEE
14 years 2 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 9 months ago
Corpus-based Schema Matching
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
CVPR
2009
IEEE
15 years 3 months ago
Learning General Optical Flow Subspaces for Egomotion Estimation and Detection of Motion Anomalies
This paper deals with estimation of dense optical flow and ego-motion in a generalized imaging system by exploiting probabilistic linear subspace constraints on the flow. We dea...
Richard Roberts (Georgia Institute of Technology),...