Sciweavers

2252 search results - page 235 / 451
» Improving Random Forests
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 4 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
16 years 3 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
105
Voted
ATS
2009
IEEE
117views Hardware» more  ATS 2009»
15 years 10 months ago
N-distinguishing Tests for Enhanced Defect Diagnosis
Diagnostic ATPG has traditionally been used to generate test patterns that distinguish pairs of modeled faults. In this work, we investigate the use of n-distinguishing test sets,...
Gang Chen, Janusz Rajski, Sudhakar M. Reddy, Irith...
COMPGEOM
2009
ACM
15 years 10 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
15 years 10 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta