Sciweavers

806 search results - page 15 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
DCC
2006
IEEE
14 years 7 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 8 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn
DATE
2004
IEEE
136views Hardware» more  DATE 2004»
13 years 11 months ago
Data Windows: A Data-Centric Approach for Query Execution in Memory-Resident Databases
Structured embedded databases are currently becoming an integrated part of embedded systems, thus, enabling higher standards in system automation. These embedded databases are typ...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
ICDCS
2008
IEEE
14 years 2 months ago
Multi-query Optimization for Distributed Similarity Query Processing
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
Yi Zhuang, Qing Li, Lei Chen 0002
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin