Sciweavers

405 search results - page 29 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
AI
1999
Springer
13 years 7 months ago
Learning Action Strategies for Planning Domains
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
Roni Khardon
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 7 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ICCV
2007
IEEE
14 years 9 months ago
A Robust Algorithm for Fiber-Bundle Atlas Construction
In this paper, we demonstrate an integrated registration and clustering algorithm to compute an atlas of fiberbundles from a set of multi-subject diffusion weighted MR images. We ...
Ulas Ziyan, Mert R. Sabuncu, W. Eric L. Grimson, C...
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
13 years 12 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
SIAMMAX
2010
145views more  SIAMMAX 2010»
13 years 2 months ago
Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
Zhaosong Lu