Sciweavers

1026 search results - page 141 / 206
» On Finding Minimal w-cutset
Sort
View
APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
13 years 11 months ago
The Directed Minimum Latency Problem
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Viswanath Nagarajan, R. Ravi
CISS
2008
IEEE
13 years 11 months ago
An efficient adaptive distributed space time coding scheme for cooperative relaying
A non-regenerative dual-hop wireless system based on distributed Alamouti space-time coding is considered. It is assumed that each relay retransmits an appropriately scaled space-t...
Jamshid Abouei, Hossein Bagheri, Amir K. Khandani
CVPR
2008
IEEE
13 years 11 months ago
Off-axis aperture camera: 3D shape reconstruction and image restoration
In this paper we present a novel 3D surface and image reconstruction method based on the off-axis aperture camera. The key idea is to change the size or the 3-D location of the ap...
Qingxu Dou, Paolo Favaro
ACL
2008
13 years 10 months ago
Enhancing Performance of Lexicalised Grammars
This paper describes how external resources can be used to improve parser performance for heavily lexicalised grammars, looking at both robustness and efficiency. In terms of robu...
Rebecca Dridan, Valia Kordoni, Jeremy Nicholson
CCCG
2010
13 years 10 months ago
On polygons excluding point sets
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
Radoslav Fulek, Balázs Keszegh, Filip Moric...