Sciweavers

358 search results - page 35 / 72
» GCD of Many Integers
Sort
View
EMNLP
2007
13 years 9 months ago
Modelling Compression with Discourse Constraints
Sentence compression holds promise for many applications ranging from summarisation to subtitle generation and subtitle generation. The task is typically performed on isolated sen...
James Clarke, Mirella Lapata
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 7 months ago
On some invariants in numerical semigroups and estimations of the order bound
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
Anna Oneto, Grazia Tamone
DAM
2008
83views more  DAM 2008»
13 years 7 months ago
Multi-group support vector machines with measurement costs: A biobjective approach
Support Vector Machine has shown to have good performance in many practical classification settings. In this paper we propose, for multi-group classification, a biobjective optimi...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon