1670 search results - page 215 / 334 » On Skolemization in constructive theories |
139
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
153
click to vote
TIT
1998
15 years 6 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
184
click to vote
PRICAI
2010
Springer
15 years 4 months ago
2010
Springer
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
166
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
176
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...