Sciweavers

1450 search results - page 56 / 290
» Complexity of Inference in Graphical Models
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
12 years 10 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
CGI
1998
IEEE
13 years 12 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
CIVR
2004
Springer
111views Image Analysis» more  CIVR 2004»
14 years 1 months ago
An Inference Network Approach to Image Retrieval
Most image retrieval systems only allow a fragment of text or an example image as a query. Most users have more complex information needs that are not easily expressed in either of...
Donald Metzler, R. Manmatha
ICML
2009
IEEE
14 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint