Sciweavers

7904 search results - page 1263 / 1581
» Sequence Query Processing
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
ICDT
2010
ACM
161views Database» more  ICDT 2010»
16 years 4 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
SOSP
2001
ACM
16 years 3 months ago
Mesh Based Content Routing using XML
We have developed a new approach for reliably multicasting timecritical data to heterogeneous clients over mesh-based overlay networks. To facilitate intelligent content pruning, ...
Alex C. Snoeren, Kenneth Conley, David K. Gifford
STACS
2010
Springer
16 years 1 months ago
Evasiveness and the Distribution of Prime Numbers
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
László Babai, Anandam Banerjee, Ragh...
« Prev « First page 1263 / 1581 Last » Next »