Sciweavers

1322 search results - page 109 / 265
» Parameterized counting problems
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
COCOA
2008
Springer
13 years 10 months ago
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
Rhonda Chaytor, Patricia A. Evans, Todd Wareham
COCOA
2008
Springer
13 years 10 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke
CVPR
2005
IEEE
14 years 11 months ago
Complex 3D Shape Recovery Using a Dual-Space Approach
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
Chen Liang, Kwan-Yee Kenneth Wong
COMPGEOM
2009
ACM
14 years 1 months ago
The scale axis picture show
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
Joachim Giesen, Balint Miklos, Mark Pauly, Camille...