Sciweavers

436 search results - page 70 / 88
» Multi-Objective Probability Collectives
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
AIME
2009
Springer
15 years 1 months ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...
CIKM
2008
Springer
14 years 11 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
EDM
2008
127views Data Mining» more  EDM 2008»
14 years 11 months ago
Adaptive Test Design with a Naive Bayes Framework
Bayesian graphical models are commonly used to build student models from data. A number of standard algorithms are available to train Bayesian models from student skills assessment...
Michel C. Desmarais, Alejandro Villarreal, Michel ...
BMCBI
2006
92views more  BMCBI 2006»
14 years 9 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...