3874 search results - page 510 / 775 » Approximation Algorithms for k-hurdle Problems |
150
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
176
click to vote
ICPADS
1994
IEEE
15 years 9 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
118
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
139
click to vote
MSN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size a...
173
click to vote
IEEEMSP
2002
IEEE
15 years 9 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...