Sciweavers

6562 search results - page 1312 / 1313
» Noetherianity and Combination Problems
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 6 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 5 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
INFOCOM
2005
IEEE
13 years 11 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
SP
2010
IEEE
220views Security Privacy» more  SP 2010»
13 years 9 months ago
TaintScope: A Checksum-Aware Directed Fuzzing Tool for Automatic Software Vulnerability Detection
—Fuzz testing has proven successful in finding security vulnerabilities in large programs. However, traditional fuzz testing tools have a well-known common drawback: they are in...
Tielei Wang, Tao Wei, Guofei Gu, Wei Zou
WSC
1997
13 years 6 months ago
A Framework for the Simulation Experimentation Process
Modeling and simulation of very large systems introduces a number of issues that are not seen in the modeling of simpler systems. These arise because the resource requirements for...
Thomas C. Fall
« Prev « First page 1312 / 1313 Last » Next »