Sciweavers

846 search results - page 96 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
ICAIL
2003
ACM
15 years 6 months ago
Induction of Defeasible Logic Theories in the Legal Domain
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
Benjamin Johnston, Guido Governatori
SCFBM
2008
131views more  SCFBM 2008»
15 years 27 days ago
FASH: A web application for nucleotides sequence search
: FASH (Fourier Alignment Sequence Heuristics) is a web application, based on the Fast Fourier Transform, for finding remote homologs within a long nucleic acid sequence. Given a ...
Isana Veksler-Lublinsky, Danny Barash, Chai Avisar...
TSP
2010
14 years 8 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
AAAI
2011
14 years 1 months ago
Learning Accuracy and Availability of Humans Who Help Mobile Robots
When mobile robots perform tasks in environments with humans, it seems appropriate for the robots to rely on such humans for help instead of dedicated human oracles or supervisors...
Stephanie Rosenthal, Manuela M. Veloso, Anind K. D...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 5 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...