Sciweavers

9405 search results - page 1450 / 1881
» Computing a Model of Set Theory
Sort
View
COOPIS
2002
IEEE
15 years 11 months ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman
FOCS
2002
IEEE
15 years 11 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
MM
2009
ACM
187views Multimedia» more  MM 2009»
15 years 11 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
IPPS
1999
IEEE
15 years 11 months ago
Non-Preemptive Scheduling of Real-Time Threads on Multi-Level-Context Architectures
The rapid progress in high-performance microprocessor design has made it di cult to adapt real-time scheduling results to new models of microprocessor hardware, thus leaving an un...
Jan Jonsson, Henrik Lönn, Kang G. Shin
FOSSACS
1999
Springer
15 years 11 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
« Prev « First page 1450 / 1881 Last » Next »