Sciweavers

4816 search results - page 605 / 964
» Performance analysis of the AntNet algorithm
Sort
View
ICALP
2005
Springer
16 years 9 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
EGC
2005
Springer
16 years 7 days ago
Statistical Modeling and Segmentation in Cardiac MRI Using a Grid Computing Approach
Abstract. Grid technology is widely emerging as a solution for wide-spread applicability of computerized analysis and processing procedures in biomedical sciences. In this paper we...
Sebastián Ordas, Hans C. van Assen, Loic Bo...
APGV
2004
ACM
176views Visualization» more  APGV 2004»
16 years 7 days ago
Towards perceptually realistic talking heads: models, methods and McGurk
Motivated by the need for an informative, unbiased and quantitative perceptual method for the development and evaluation of a talking head we are developing, we propose a new test...
Darren Cosker, Susan Paddock, A. David Marshall, P...
RANDOM
1998
Springer
15 years 11 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
15 years 11 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas