Sciweavers

2498 search results - page 107 / 500
» Data Structures with Unpredictable Timing
Sort
View
ITCC
2005
IEEE
15 years 3 months ago
Grid-Based Collaboration in Interactive Data Language Applications
Interactive Data Language (IDL) is an array-oriented data analysis and visualization application, which is widely used in research, commerce, and education. It is meaningful to ma...
Minjun Wang, Geoffrey Fox, Marlon E. Pierce
SYNTHESE
2008
112views more  SYNTHESE 2008»
14 years 9 months ago
A sufficient condition for pooling data
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
Frederick Eberhardt
JEA
2008
112views more  JEA 2008»
14 years 10 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SPIRE
2010
Springer
14 years 8 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
DCC
2007
IEEE
15 years 9 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...