Sciweavers

635 search results - page 96 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
AIPS
2009
14 years 11 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
JACM
2006
99views more  JACM 2006»
14 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
14 years 7 months ago
Graph Regularized Transductive Classification on Heterogeneous Information Networks
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
Ming Ji, Yizhou Sun, Marina Danilevsky, Jiawei Han...
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson