Sciweavers

1142 search results - page 202 / 229
» Approximability of Clausal Constraints
Sort
View
FOCS
2008
IEEE
15 years 8 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
WCNC
2008
IEEE
15 years 8 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung
CVPR
2006
IEEE
15 years 8 months ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black
ICDCS
2005
IEEE
15 years 7 months ago
Optimal Component Composition for Scalable Stream Processing
Stream processing has become increasingly important with emergence of stream applications such as audio/video surveillance, stock price tracing, and sensor data analysis. A challe...
Xiaohui Gu, Philip S. Yu, Klara Nahrstedt
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 7 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella