Sciweavers

552 search results - page 55 / 111
» On the Complexity of Join Predicates
Sort
View
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 8 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
DBPL
2009
Springer
144views Database» more  DBPL 2009»
14 years 4 months ago
General Database Statistics Using Entropy Maximization
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
Raghav Kaushik, Christopher Ré, Dan Suciu
ICPADS
2008
IEEE
14 years 4 months ago
Bootstrapping in Peer-to-Peer Systems
Peer-to-Peer systems have become a substantial element in computer networking. Distributing the load and splitting complex tasks are only some reasons why many developers have com...
Mirko Knoll, Arno Wacker, Gregor Schiele, Torben W...
CIKM
1998
Springer
14 years 2 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
BIOCOMP
2006
13 years 11 months ago
Study on Properties of Protein Folding Conformation Network
- Protein folding conformations take the form of networks, sets of conformations (vertices) joined together in pairs by links or edges. Protein folding conformation network is a co...
Nengchao Wang, Zhongjun Wang