Sciweavers

6833 search results - page 302 / 1367
» Some two-character sets
Sort
View
IJCAI
2003
15 years 8 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...
NAACL
2003
15 years 8 months ago
Japanese Named Entity Extraction with Redundant Morphological Analysis
Named Entity (NE) extraction is an important subtask of document processing such as information extraction and question answering. A typical method used for NE extraction of Japan...
Masayuki Asahara, Yuji Matsumoto
CRYPTO
2010
Springer
228views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
On Generalized Feistel Networks
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
Viet Tung Hoang, Phillip Rogaway
FSTTCS
2008
Springer
15 years 7 months ago
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
Juan Rodríguez-Hortalá
164
Voted
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 6 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc