Sciweavers

3384 search results - page 613 / 677
» More Testable Properties
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
DAS
2010
Springer
14 years 1 months ago
Binarization of historical document images using the local maximum and minimum
This paper presents a new document image binarization technique that segments the text from badly degraded historical document images. The proposed technique makes use of the imag...
Bolan Su, Shijian Lu, Chew Lim Tan
ECMDAFA
2010
Springer
238views Hardware» more  ECMDAFA 2010»
14 years 1 months ago
eSPEM - A SPEM Extension for Enactable Behavior Modeling
OMG’s SPEM – by means of its (semi-)formal notation – allows for a detailed description of development processes and methodologies, but can only be used for a rather coarse d...
Ralf Ellner, Samir Al-Hilank, Johannes Drexler, Ma...
GECCO
2010
Springer
230views Optimization» more  GECCO 2010»
14 years 1 months ago
Exponential natural evolution strategies
The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness....
Tobias Glasmachers, Tom Schaul, Yi Sun, Daan Wiers...