Sciweavers

2961 search results - page 304 / 593
» Optimization of tele-immersion codes
Sort
View
121
Voted
IJIT
2004
15 years 5 months ago
An Evaluation of Algorithms for Single-Echo Biosonar Target Classification
A recent neuro-spiking coding scheme for feature extraction from biosonar echoes of various plants is examined with a variety of stochastic classifiers. Feature vectors derived are...
Turgay Temel, John Hallam
130
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 3 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
99
Voted
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 3 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer
116
Voted
CORR
2000
Springer
99views Education» more  CORR 2000»
15 years 3 months ago
Adaptive simulated annealing (ASA): Lessons learned
Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using othe...
Lester Ingber
131
Voted
SIGSOFT
2010
ACM
15 years 1 months ago
A trace simplification technique for effective debugging of concurrent programs
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
Nicholas Jalbert, Koushik Sen