Sciweavers

914 search results - page 148 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
CSFW
2007
IEEE
14 years 3 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...
PAKDD
2005
ACM
160views Data Mining» more  PAKDD 2005»
14 years 2 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...
PODS
2000
ACM
146views Database» more  PODS 2000»
14 years 1 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
BIOCOMP
2007
13 years 10 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
CIDR
2003
109views Algorithms» more  CIDR 2003»
13 years 10 months ago
SkyQuery: A Web Service Approach to Federate Databases
Traditional science searched for new objects and phenomena that led to discoveries. Tomorrow's science will combine together the large pool of information in scientific archi...
Tanu Malik, Alexander S. Szalay, Tamas Budavari, A...