Sciweavers

203 search results - page 23 / 41
» On Inducing Polygons and Related Problems
Sort
View
STACS
2005
Springer
14 years 1 months ago
The Core of a Countably Categorical Structure
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
Manuel Bodirsky
FLAIRS
2004
13 years 9 months ago
Typicality, Contextual Inferences and Object Determination Logic
We propose a rigorous definition of the notion of typicality, making use of the strict partial order naturally induced among the objects at hand by a given concept. This perspecti...
Michael Freund, Jean-Pierre Desclés, Anca P...
ICS
2010
Tsinghua U.
14 years 4 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
COLT
2005
Springer
14 years 1 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
JAIR
2008
111views more  JAIR 2008»
13 years 7 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak