20066 search results - page 129 / 4014 » T Spaces |
SSPR
2010
Springer
14 years 8 months ago
2010
Springer
The aim of this paper is to find an answer to the question: What is the difference between dissimilarity-based classifications(DBCs) and other kernelbased classifications(KBCs)?...
WALCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
SEMWEB
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Measuring similarity between ontologies can be very useful for different purposes, e.g., finding an ontology to replace another, or finding an ontology in which queries c...
ASPLOS
2012
ACM
13 years 5 months ago
2012
ACM
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
106
Voted
STOC
2012
ACM
13 years 16 days ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...