Sciweavers

152 search results - page 24 / 31
» In time alone: on the computational power of querying the hi...
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
FOCS
2004
IEEE
13 years 11 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
HCW
2000
IEEE
14 years 4 days ago
Combining Workstations and Supercomputers to Support Grid Applications: The Parallel Tomography Experience
Computational Grids are becoming an increasingly important and powerful platform for the execution of largescale, resource-intensive applications. However, it remains a challenge ...
Shava Smallen, Walfredo Cirne, Jaime Frey, Francin...
ICFP
2012
ACM
11 years 10 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
APL
2000
ACM
14 years 3 days ago
High-level object oriented programming with array technology
Although classical object-oriented programming languages provide high-level modeling capacities t data type, inheritance etc.), they remain low-level when it comes to data manipul...
Philippe Mougin