Sciweavers

340 search results - page 59 / 68
» Clustering with Lower Bound on Similarity
Sort
View
75
Voted
IVC
2007
114views more  IVC 2007»
14 years 9 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
TSP
2008
114views more  TSP 2008»
14 years 9 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
TSP
2008
148views more  TSP 2008»
14 years 9 months ago
Statistically Robust Design of Linear MIMO Transceivers
The treatment of channel state information (CSI) is critical in the design of MIMO systems. Accurate CSI at the transmitter is often not possible or may require high feedback rate...
Xi Zhang, Daniel Pérez Palomar, Björn ...
TELSYS
2002
122views more  TELSYS 2002»
14 years 9 months ago
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...
George C. Lin, Tatsuya Suda, Fumio Ishizaki
TOMS
2011
101views more  TOMS 2011»
14 years 4 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...