Sciweavers

3934 search results - page 368 / 787
» Approximate Schedulability Analysis
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
SCALESPACE
2009
Springer
16 years 1 months ago
A Non-local Approach to Shape from Ambient Shading
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
Emmanuel Prados, Nitin Jindal, Stefano Soatto
IBPRIA
2007
Springer
16 years 27 days ago
Boundary Shape Recognition Using Accumulated Length and Angle Information
In this paper we present a method to recognize shapes by analyzing a polygonal approximation of their boundaries. The method is independent of the used approximation method since i...
Marçal Rusiñol, Philippe Dosch, Jose...
114
Voted
INFOCOM
2005
IEEE
16 years 10 days ago
Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks
— In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: Firstly, a throughput model based on...
Xin Wang, Koushik Kar
TSP
2008
87views more  TSP 2008»
15 years 6 months ago
A Proof of Convergence of the MAP Turbo-Detector to the AWGN Case
In this paper, we consider a coded transmission over a frequency selective channel. We propose to study analytically the convergence of the turbo-detector using a maximum a poster...
Noura Sellami, Aline Roumy, Inbar Fijalkow