Sciweavers

421 search results - page 51 / 85
» String Distances and Uniformities
Sort
View
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
13 years 10 months ago
Left invertibility of discrete systems with finite inputs and quantized output
Abstract-- The aim of this paper is to address left invertibility for dynamical systems with inputs and outputs in discrete sets. We study systems that evolve in discrete time with...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi
IJCAI
1997
13 years 9 months ago
Charts, Interaction-free Grammars, and the Compact Representation of Ambiguity
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
Marc Dymetman
DKE
2007
90views more  DKE 2007»
13 years 8 months ago
On utilizing variables for specifying FDs in data-centric XML documents
We are interested in specifying functional dependencies (FDs) for data-centric XML documents (XML documents that are used mainly for data storage). FDs are a natural constraint. S...
Wai Yin Mok
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
ALT
2006
Springer
14 years 5 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri