Sciweavers

846 search results - page 141 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
UAI
2004
13 years 10 months ago
Monotonicity in Bayesian Networks
For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable varia...
Linda C. van der Gaag, Hans L. Bodlaender, A. J. F...
AAAI
1992
13 years 10 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
JAIR
2010
130views more  JAIR 2010»
13 years 3 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
13 years 15 days ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
14 years 10 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...