Sciweavers

1522 search results - page 85 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
EMNLP
2011
12 years 7 months ago
Simple Effective Decipherment via Combinatorial Optimization
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
Taylor Berg-Kirkpatrick, Dan Klein
FOSSACS
2010
Springer
14 years 2 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
CICLING
2010
Springer
14 years 2 months ago
Chinese Event Descriptive Clause Splitting with Structured SVMs
: Chinese event descriptive clause splitting is the task of splitting a complex Chinese sentence into several clauses. In this paper, we present a discriminative approach for Chine...
Junsheng Zhou, Yabing Zhang, Xinyu Dai, Jiajun Che...
CRYPTO
2007
Springer
144views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
Jean-Sébastien Coron
XPU
2004
Springer
14 years 1 months ago
Towards a Proper Integration of Large Refactorings in Agile Software Development
Refactoring is a key element of many agile software development methods. While most developers associate small design changes with the term refactoring (as described by Martin Fowl...
Martin Lippert