Sciweavers

11214 search results - page 109 / 2243
» Just-in-time data structures
Sort
View
IJCSA
2006
129views more  IJCSA 2006»
13 years 10 months ago
The SH-Tree: A Novel and Flexible Super Hybrid Index Structure for Similarity Search on Multidimensional Data
Approaches to indexing and searching feature vectors are an indispensable factor to support similarity search effectively and efficiently. Such feature vectors extracted from real...
Tran Khanh Dang
KBSE
2007
IEEE
14 years 4 months ago
Assertion-based repair of complex data structures
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sar...
POPL
2011
ACM
13 years 28 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
COLING
2008
13 years 11 months ago
Entailment-based Question Answering for Structured Data
This paper describes a Question Answering system which retrieves answers from structured data regarding cinemas and movies. The system represents the first prototype of a multilin...
Bogdan Sacaleanu, Constantin Orasan, Christian Spu...
IJHPCA
2006
122views more  IJHPCA 2006»
13 years 10 months ago
A New Hardware Monitor Design to Measure Data Structure-Specific Cache Eviction Information
In this paper, we propose a hardware performance monitor that provides support not only for measuring cache misses and the addresses associated with them, but also for determining...
Bryan R. Buck, Jeffrey K. Hollingsworth