Sciweavers

526 search results - page 57 / 106
» Improved Decomposition of STGs
Sort
View
AAAI
1998
13 years 11 months ago
Maintaining Consistency in Hierarchical Reasoning
We explore techniques for maintaining consistency in reasoning when employing dynamic hierarchical task decompositions. In particular, we consider the difficulty of maintaining co...
Robert E. Wray III, John E. Laird
COGSCI
2002
71views more  COGSCI 2002»
13 years 9 months ago
Spanning seven orders of magnitude: a challenge for cognitive modeling
Much of cognitive psychology focuses on effects measured in tens of milliseconds while significant educational outcomes take tens of hours to achieve. The task of bridging this ga...
John R. Anderson
IJCV
2000
133views more  IJCV 2000»
13 years 9 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
ML
2002
ACM
163views Machine Learning» more  ML 2002»
13 years 9 months ago
Structural Modelling with Sparse Kernels
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
Steve R. Gunn, Jaz S. Kandola
PAMI
2010
156views more  PAMI 2010»
13 years 8 months ago
An Adaptive and Stable Method for Fitting Implicit Polynomial Curves and Surfaces
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
Bo Zheng, Jun Takamatsu, Katsushi Ikeuchi