Sciweavers

2523 search results - page 120 / 505
» Objective: In Minimum Context
Sort
View
PCM
2004
Springer
91views Multimedia» more  PCM 2004»
15 years 9 months ago
Preprocessing of Depth and Color Information for Layered Depth Image Coding
The layered depth image (LDI) is a popular approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute val...
Seung-Uk Yoon, Sung-Yeol Kim, Yo-Sung Ho
ICDCSW
2003
IEEE
15 years 9 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu
COCOON
2008
Springer
15 years 5 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
EVOW
2008
Springer
15 years 5 months ago
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, wit...
Antonio Augusto Chaves, Luiz Antonio Nogueira Lore...
ECCC
2006
109views more  ECCC 2006»
15 years 4 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy