Sciweavers

9359 search results - page 292 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 6 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICC
2007
IEEE
16 years 26 days ago
ORC-GPS: Output Rate-Controlled Scheduling Policy for Delay Guarantees
Abstract—Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2 Q) and Self-Clocked Fair Queueing (SCFQ) have been propo...
Masaki Hanada, Hidenori Nakazato
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 21 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
EUROSYS
2007
ACM
15 years 10 months ago
Whodunit: transactional profiling for multi-tier applications
This paper is concerned with performance debugging of multitier applications, such as commonly found in servers and dynamic-content web sites. Existing tools and techniques for pr...
Anupam Chanda, Alan L. Cox, Willy Zwaenepoel