Sciweavers

4324 search results - page 35 / 865
» A Generalized Representer Theorem
Sort
View
148
Voted
MSS
2008
IEEE
80views Hardware» more  MSS 2008»
15 years 6 months ago
Utility representation of lower separable preferences
Topological separability is crucial for the utility representation of a complete preference relation. When preferences are incomplete, this axiom has suitably de...ned counterpart...
Özgür Yilmaz
CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
15 years 1 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan
APAL
2011
15 years 1 months ago
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
Benjamin D. Miller
FOSSACS
2004
Springer
15 years 10 months ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke