Sciweavers

24 search results - page 1 / 5
» Execution time analysis of a top-down R-tree construction al...
Sort
View
IPL
2007
80views more  IPL 2007»
13 years 4 months ago
Execution time analysis of a top-down R-tree construction algorithm
A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leuten...
Houman Alborzi, Hanan Samet
CP
2000
Springer
13 years 8 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
IJFCS
2008
158views more  IJFCS 2008»
13 years 4 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
13 years 12 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
IEAAIE
2010
Springer
13 years 2 months ago
Constructive Neural Networks to Predict Breast Cancer Outcome by Using Gene Expression Profiles
Abstract. Gene expression profiling strategies have attracted considerable interest from biologist due to the potential for high throughput analysis of hundreds of thousands of gen...
Daniel Urda, José Luis Subirats, Leonardo F...