Sciweavers

841 search results - page 35 / 169
» Approximability of Minimum AND-Circuits
Sort
View
NIPS
1996
13 years 10 months ago
Early Brain Damage
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
Volker Tresp, Ralph Neuneier, Hans-Georg Zimmerman...
WINET
2008
86views more  WINET 2008»
13 years 8 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
AI
1998
Springer
13 years 8 months ago
Uncertainty Measures of Rough Set Prediction
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
Ivo Düntsch, Günther Gediga
ICALP
2001
Springer
14 years 1 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
FOCS
2000
IEEE
14 years 1 months ago
A polylogarithmic approximation of the minimum bisection
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
Uriel Feige, Robert Krauthgamer