Sciweavers

201 search results - page 19 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
TKDE
2010
184views more  TKDE 2010»
13 years 7 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ICTAI
2003
IEEE
14 years 1 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
14 years 27 days ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
IJCAI
2007
13 years 10 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
BMCBI
2008
140views more  BMCBI 2008»
13 years 8 months ago
FUNYBASE: a FUNgal phYlogenomic dataBASE
Background: The increasing availability of fungal genome sequences provides large numbers of proteins for evolutionary and phylogenetic analyses. However the heterogeneity of data...
Sylvain Marthey, Gabriela Aguileta, Françoi...