Sciweavers

1523 search results - page 267 / 305
» The Computational Complexity of Linear Optics
Sort
View
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 7 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
TCAD
2008
106views more  TCAD 2008»
13 years 7 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
TSP
2008
178views more  TSP 2008»
13 years 7 months ago
Extended Object Tracking Using Monte Carlo Methods
Abstract-- This paper addresses the problem of tracking extended objects, such as ships or a convoy of vehicles moving in urban environment. Two Monte Carlo techniques for extended...
Donka S. Angelova, Lyudmila Mihaylova
TSP
2008
109views more  TSP 2008»
13 years 7 months ago
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris