Sciweavers

1237 search results - page 23 / 248
» Strictness and Totality Analysis
Sort
View
TSD
2005
Springer
15 years 3 months ago
Robust Rule-Based Method for Automatic Break Assignment in Russian Texts
In this paper a new rule-based approach to break assignment for the Russian language is discussed. It is a flexible and robust method of segmentation of texts in Russian in prosod...
Ilya Oparin
ICALP
2004
Springer
15 years 3 months ago
Representing Nested Inductive Types Using W-Types
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
Michael Abbott, Thorsten Altenkirch, Neil Ghani
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 10 months ago
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
Haris Aziz, Felix Brandt, Hans Georg Seedig
CANDC
2006
ACM
14 years 9 months ago
Unraveling the nature of the segmentation clock: Intrinsic disorder of clock proteins and their interaction map
Vertebrate segmentation has been proved to be under a strict temporal control governed by a biological clock, known as the segmentation clock. The present experimental evidence su...
Sourav Roy, Santiago Schnell, Predrag Radivojac
ICALP
2007
Springer
15 years 4 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...