Sciweavers

4047 search results - page 55 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
LPNMR
2009
Springer
15 years 4 months ago
On Reductive Semantics of Aggregates in Answer Set Programming
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Joohyung Lee, Yunsong Meng
ORDER
2002
104views more  ORDER 2002»
14 years 11 months ago
Partially Well-Ordered Closed Sets of Permutations
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
ALT
2005
Springer
15 years 8 months ago
An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on th...
Adam Kowalczyk, Olivier Chapelle
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
15 years 2 hour ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 6 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef