Sciweavers

537 search results - page 16 / 108
» A new upper bound for 3-SAT
Sort
View
AAAI
2010
13 years 10 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
CIARP
2004
Springer
14 years 6 days ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
EUROPAR
2005
Springer
14 years 2 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 8 months ago
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
Daniel W. Cranston, Gexin Yu
ASPDAC
2007
ACM
92views Hardware» more  ASPDAC 2007»
14 years 13 days ago
New Block-Based Statistical Timing Analysis Approaches Without Moment Matching
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
Ruiming Chen, Hai Zhou