Sciweavers

914 search results - page 51 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 10 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
RECOMB
2003
Springer
14 years 11 months ago
An integrated probabilistic model for functional prediction of proteins
We develop an integrated probabilistic model to combine protein physical interactions, genetic interactions, highly correlated gene expression network, protein complex data, and d...
Minghua Deng, Ting Chen, Fengzhu Sun
COMPGEOM
2000
ACM
14 years 3 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
IWCM
2004
Springer
14 years 4 months ago
Tracking Complex Objects Using Graphical Object Models
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 10 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...