Sciweavers

622 search results - page 47 / 125
» Understanding and Extending Graphplan
Sort
View
JMLR
2010
128views more  JMLR 2010»
13 years 7 months ago
Iterative Scaling and Coordinate Descent Methods for Maximum Entropy Models
Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With...
Fang-Lan Huang, Cho-Jui Hsieh, Kai-Wei Chang, Chih...
GI
2009
Springer
13 years 6 months ago
Source Conflicts in Bayesian Identification
: In Bayesian identification an ID source is in conflict with the other ID sources, if both provide substantially different, reliable information on a tracked object. After discuss...
Max Krüger, David Hirschhäuser
ICDM
2009
IEEE
154views Data Mining» more  ICDM 2009»
13 years 6 months ago
GSML: A Unified Framework for Sparse Metric Learning
There has been significant recent interest in sparse metric learning (SML) in which we simultaneously learn both a good distance metric and a low-dimensional representation. Unfor...
Kaizhu Huang, Yiming Ying, Colin Campbell
CSCW
2010
ACM
13 years 6 months ago
Infrastructure Time: Long-term Matters in Collaborative Development
This paper addresses the collaborative development of information infrastructure for supporting data-rich scientific collaboration. Studying infrastructure development empirically ...
Helena Karasti, Karen S. Baker, Florence Millerand
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 5 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel