Sciweavers

2089 search results - page 188 / 418
» A New Problem in String Searching
Sort
View
97
Voted
JAIR
2006
179views more  JAIR 2006»
14 years 10 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
151
Voted
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
13 years 10 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
89
Voted
ICFP
2001
ACM
15 years 10 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
70
Voted
FCT
2005
Springer
15 years 3 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
ECAI
2004
Springer
15 years 3 months ago
Automatic Recognition of Famous Artists by Machine
The paper addresses the question whether it is possible for a machine to learn to distinguish and recognise famous musicians (concert pianists), based on their style of playing. We...
Gerhard Widmer, Patrick Zanon