Sciweavers

4536 search results - page 41 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
66
Voted
COMSIS
2010
14 years 7 months ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu
ICCS
2009
Springer
15 years 4 months ago
An Intelligent Tutoring System for Interactive Learning of Data Structures
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
Rafael del Vado Vírseda, Pablo Ferná...
PKDD
2007
Springer
102views Data Mining» more  PKDD 2007»
15 years 3 months ago
Towards Data Mining Without Information on Knowledge Structure
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
Alexandre Vautier, Marie-Odile Cordier, Rene Quini...
ICSE
2010
IEEE-ACM
15 years 2 months ago
Dynamic symbolic data structure repair
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
Ishtiaque Hussain, Christoph Csallner
DAWAK
2005
Springer
15 years 3 months ago
A Tree Comparison Approach to Detect Changes in Data Warehouse Structures
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
Johann Eder, Christian Koncilia, Karl Wiggisser