Sciweavers

406 search results - page 36 / 82
» Privacy-Preserving Set Union
Sort
View
ACL
2008
13 years 9 months ago
Query-based Sentence Fusion is Better Defined and Leads to More Preferred Results than Generic Sentence Fusion
We show that question-based sentence fusion is a better defined task than generic sentence fusion (Q-based fusions are shorter, display less variety in length, yield more identica...
Emiel Krahmer, Erwin Marsi, Paul Pelt
IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 9 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
13 years 7 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
IPL
2008
78views more  IPL 2008»
13 years 7 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser
ENDM
2007
104views more  ENDM 2007»
13 years 7 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink