Sciweavers

593 search results - page 62 / 119
» An approach to benchmarking configuration complexity
Sort
View
PDPTA
2004
13 years 10 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
CVPR
2010
IEEE
14 years 5 months ago
Locality-constrained Linear Coding for Image Classification
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
Jinjun Wang, Jianchao Yang, Kai Yu, Fengjun Lv
DOCENG
2006
ACM
14 years 2 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
AAAI
2007
13 years 11 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
VLDB
2002
ACM
143views Database» more  VLDB 2002»
13 years 8 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït