Sciweavers

1383 search results - page 261 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 6 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
15 years 6 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
CVPR
2007
IEEE
15 years 6 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
15 years 6 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
ICEBE
2007
IEEE
126views Business» more  ICEBE 2007»
15 years 6 months ago
Consumer-Centric Web Services Discovery and Subscription
Nowadays, there are a number of similar web services over the internet or intranet. They provide consumers with more choices according to their personalized QoS requirements. Howe...
Xuanzhe Liu, Li Zhou, Gang Huang, Hong Mei