1578 search results - page 291 / 316 » Algorithmic randomness of continuous functions |
JUCS
2006
13 years 8 months ago
2006
: Nowadays, many daily human activities such as education, trade, talks, etc are done by using the Internet. In such things as registration on Internet web sites, hackers write pro...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
SISAP
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
ASIAN
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
ESA
2007
Springer
14 years 15 days ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...