Sciweavers

5244 search results - page 769 / 1049
» Structural Complexity of AvgBPP
Sort
View
OSDI
2008
ACM
16 years 7 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
221
Voted
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EDBT
2006
ACM
150views Database» more  EDBT 2006»
16 years 6 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 6 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
ICSE
2003
IEEE-ACM
16 years 6 months ago
Scaling Step-Wise Refinement
Step-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Eq...
Don S. Batory, Jacob Neal Sarvela, Axel Rauschmaye...