1405 search results - page 98 / 281 » Popularity at Minimum Cost |
149
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
143
click to vote
PERCOM
2003
ACM
16 years 4 months ago
2003
ACM
Distributed weighted fair scheduling schemes for QoS support in wireless networks have not yet become standard. In this paper we propose an Admission Control and Dynamic Bandwidth...
143
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
133
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose an interleaved memory organization supporting multi-pattern parallel accesses in twodimensional (2D) addressing space. Our proposal targets computing systems with high ...
126
click to vote
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...