15416 search results - page 199 / 3084 » Embeddings of Computable Structures |
145
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
162
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
186
Voted
DOCENG
2008
ACM
15 years 6 months ago
2008
ACM
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
137
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
We present a method for unsupervised discovery of abnormal occurrences of activities in multi-dimensional time series data. Unsupervised activity discovery approaches differ from ...
147
click to vote
IPCO
2008
15 years 5 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...