Sciweavers

350 search results - page 7 / 70
» Soft Linear Set Theory
Sort
View
JMLR
2006
125views more  JMLR 2006»
14 years 9 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
DCC
2008
IEEE
15 years 9 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
VMCAI
2007
Springer
15 years 3 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...
AML
2008
84views more  AML 2008»
14 years 8 months ago
Model theory of the regularity and reflection schemes
Abstract. This paper develops the model theory of ordered structures that satisfy Keisler's regularity scheme, and its strengthening REF(L) (the reflection scheme) which is an...
Ali Enayat, Shahram Mohsenipour
93
Voted
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
14 years 7 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang