Sciweavers

2714 search results - page 408 / 543
» Approximation Schemes for Scheduling
Sort
View
112
Voted
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
15 years 6 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
ICMCS
2006
IEEE
104views Multimedia» more  ICMCS 2006»
15 years 6 months ago
A Study on Spatial Scalable Coding using Vector Representation
The major advantage of vector representation of an image is that the image quality is maintained for arbitrary scaling. In recent years, a demand for scalable image coding has bee...
Yuki Yamamoto, Kei Kawamura, Hiroshi Watanabe
95
Voted
ICMCS
2005
IEEE
107views Multimedia» more  ICMCS 2005»
15 years 6 months ago
Evaluating keypoint methods for content-based copyright protection of digital images
This paper evaluates the effectiveness of keypoint methods for content-based protection of digital images. These methods identify a set of “distinctive” regions (termed keypoi...
Larry Huston, Rahul Sukthankar, Yan Ke
113
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...
AAIM
2005
Springer
75views Algorithms» more  AAIM 2005»
15 years 6 months ago
Mechanism Design for Set Cover Games When Elements Are Agents
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
Zheng Sun, Xiang-Yang Li, Weizhao Wang, Xiaowen Ch...