Sciweavers

405 search results - page 17 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
AAAI
2006
13 years 9 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
ISCA
2005
IEEE
88views Hardware» more  ISCA 2005»
14 years 1 months ago
Architecture for Protecting Critical Secrets in Microprocessors
We propose “secret-protected (SP)” architecture to enable secure and convenient protection of critical secrets for a given user in an on-line environment. Keys are examples of...
Ruby B. Lee, Peter C. S. Kwan, John Patrick McGreg...
WABI
2007
Springer
14 years 1 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
JMLR
2010
144views more  JMLR 2010»
13 years 2 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
EVOW
2006
Springer
13 years 11 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...