Sciweavers

411 search results - page 61 / 83
» Automating the Dependency Pair Method
Sort
View
NIPS
2007
14 years 2 days ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
PVLDB
2008
77views more  PVLDB 2008»
13 years 10 months ago
Efficient network aware search in collaborative tagging sites
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lak...
ICDM
2008
IEEE
156views Data Mining» more  ICDM 2008»
14 years 5 months ago
Exploiting Local and Global Invariants for the Management of Large Scale Information Systems
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
Haifeng Chen, Haibin Cheng, Guofei Jiang, Kenji Yo...
CADE
2005
Springer
14 years 11 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
JACIII
2008
148views more  JACIII 2008»
13 years 10 months ago
Optimal Route Based on Dynamic Programming for Road Networks
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...