Sciweavers

1220 search results - page 12 / 244
» Minimal Interval Completions
Sort
View
ANOR
2008
69views more  ANOR 2008»
13 years 7 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
JCP
2006
139views more  JCP 2006»
13 years 7 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana
MOC
1998
74views more  MOC 1998»
13 years 7 months ago
Diameters of complete sets of conjugate algebraic integers of small degree
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
Michel Grandcolas
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
SOCO
2008
Springer
13 years 7 months ago
Strong non-standard completeness for fuzzy logics
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
Tommaso Flaminio