Sciweavers

154 search results - page 28 / 31
» Using Proofs by Coinduction to Find
Sort
View
IPAW
2010
13 years 4 months ago
Reflections on Provenance Ontology Encodings
As more data (especially scientific data) is digitized and put on the Web, the importance of tracking and sharing its provenance metadata grows. Besides capturing the annotation pr...
Li Ding, Jie Bao, James Michaelis, Jun Zhao, Debor...
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
FOCS
1999
IEEE
13 years 11 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
CORR
2008
Springer
68views Education» more  CORR 2008»
13 years 7 months ago
Improved lower bound for deterministic broadcasting in radio networks
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every determinist...
Carlos Brito, Shailesh Vaya