Sciweavers

2620 search results - page 238 / 524
» An Evaluation Technique for Binarization Algorithms
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 11 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
EGH
2004
Springer
15 years 10 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 6 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
TSP
2008
126views more  TSP 2008»
15 years 6 months ago
HOS-Based Semi-Blind Spatial Equalization for MIMO Rayleigh Fading Channels
In this paper we concentrate on the direct semi-blind spatial equalizer design for MIMO systems with Rayleigh fading channels. Our aim is to develop an algorithm which can outperf...
Zhiguo Ding, Tharmalingam Ratnarajah, Colin Cowan