Sciweavers

1486 search results - page 165 / 298
» Algorithms for two-box covering
Sort
View
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
16 years 5 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
DAC
2007
ACM
16 years 5 months ago
Parameterized Macromodeling for Analog System-Level Design Exploration
In this paper we propose a novel parameterized macromodeling technique for analog circuits. Unlike traditional macromodels that are only extracted for a small variation space, our...
Jian Wang, Xin Li, Lawrence T. Pileggi
ICML
2003
IEEE
16 years 5 months ago
An Analysis of Rule Evaluation Metrics
In this paper we analyze the most popular evaluation metrics for separate-and-conquer rule learning algorithms. Our results show that all commonly used heuristics, including accur...
Johannes Fürnkranz, Peter A. Flach
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
16 years 4 months ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
SIGMOD
2005
ACM
165views Database» more  SIGMOD 2005»
16 years 4 months ago
Scheduling of scientific workflows in the ASKALON grid environment
Scheduling is a key concern for the execution of performancedriven Grid applications. In this paper we comparatively examine different existing approaches for scheduling of scient...
Marek Wieczorek, Radu Prodan, Thomas Fahringer