Sciweavers

1095 search results - page 75 / 219
» Preprocessing of Intractable Problems
Sort
View
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 10 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
SIAMSC
2008
111views more  SIAMSC 2008»
13 years 10 months ago
An Algebraic Multigrid Approach Based on a Compatible Gauge Reformulation of Maxwell's Equations
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a correspon...
Pavel B. Bochev, Jonathan J. Hu, Christopher M. Si...
ECCC
2000
113views more  ECCC 2000»
13 years 10 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
IDA
2002
Springer
13 years 10 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
RC
2007
128views more  RC 2007»
13 years 9 months ago
Bounds on Generalized Linear Predictors with Incomplete Outcome Data
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...
Jörg Stoye