Sciweavers

1717 search results - page 191 / 344
» A Computable Spectral Theorem
Sort
View
COMBINATORICS
2007
58views more  COMBINATORICS 2007»
15 years 6 months ago
The Initial Involution Patterns of Permutations
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
Dongsu Kim, Jang Soo Kim
TCS
2008
15 years 6 months ago
Multi-break rearrangements and chromosomal evolution
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
Max A. Alekseyev, Pavel A. Pevzner
150
Voted
COLING
2002
15 years 6 months ago
An Inference-based Approach to Dialogue System Design
We present an architecture for spoken dialogue systems where first-order inference (both theorem proving and model building) plays a crucial role in interpreting utterances of dia...
Johan Bos, Tetsushi Oka
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 5 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
DCG
2010
107views more  DCG 2010»
15 years 1 months ago
An Optimization Problem Related to Minkowski's Successive Minima
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
Romanos Malikiosis