Sciweavers

459 search results - page 74 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
CSFW
2007
IEEE
15 years 6 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
HRI
2006
ACM
15 years 5 months ago
Effective team-driven multi-model motion tracking
Autonomous robots use sensors to perceive and track objects in the world. Tracking algorithms use object motion models to estimate the position of a moving object. Tracking effic...
Yang Gu, Manuela M. Veloso
PAKDD
2005
ACM
160views Data Mining» more  PAKDD 2005»
15 years 5 months ago
Improving Mining Quality by Exploiting Data Dependency
The usefulness of the results produced by data mining methods can be critically impaired by several factors such as (1) low quality of data, including errors due to contamination, ...
Fang Chu, Yizhou Wang, Carlo Zaniolo, Douglas Stot...
AMAI
2004
Springer
15 years 5 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
90
Voted
IDEAL
2004
Springer
15 years 5 months ago
Building Genetic Networks for Gene Expression Patterns
Building genetic regulatory networks from time series data of gene expression patterns is an important topic in bioinformatics. Probabilistic Boolean networks (PBNs) have been deve...
Wai-Ki Ching, Eric S. Fung, Michael K. Ng