Sciweavers

1404 search results - page 82 / 281
» Complexity of admissible rules
Sort
View
ACL
1994
13 years 11 months ago
Compact Representations by Finite-State Transducers
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving t...
Mehryar Mohri
COORDINATION
2006
Springer
14 years 1 months ago
A Logical View of Choreography
Abstract. We present a model for choreography `a la WS-CDL and formalize it in DSTL(x), a spatio
Carlo Montangero, Laura Semini
ECAI
2010
Springer
13 years 11 months ago
An Empirical Study of the Manipulability of Single Transferable Voting
Abstract. Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences....
Toby Walsh
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 10 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
IEEEMSP
2002
IEEE
14 years 3 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...