Sciweavers

1763 search results - page 287 / 353
» Dependent random choice
Sort
View
TSP
2008
76views more  TSP 2008»
13 years 7 months ago
Eigenvalue Beamforming Using a Multirank MVDR Beamformer and Subspace Selection
Abstract--We derive eigenvalue beamformers to resolve an unknown signal of interest whose spatial signature lies in a known subspace, but whose orientation in that subspace is othe...
Ali Pezeshki, B. D. Van Veen, Louis L. Scharf, H. ...
JSAC
2007
83views more  JSAC 2007»
13 years 7 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
ECCV
2010
Springer
13 years 11 months ago
Automatic Learning of Background Semantics in Generic Surveilled Scenes
Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analy...
Carles Fernández, Jordi Gonzàlez, Xavier Roca
DCG
2000
104views more  DCG 2000»
13 years 7 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan