Sciweavers

642 search results - page 103 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
EOR
2007
96views more  EOR 2007»
13 years 9 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
TSP
2008
147views more  TSP 2008»
13 years 8 months ago
Low-Complexity MIMO Multiuser Receiver: A Joint Antenna Detection Scheme for Time-Varying Channels
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
Charlotte Dumard, Thomas Zemen
RSA
2008
103views more  RSA 2008»
13 years 8 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
TEC
2008
135views more  TEC 2008»
13 years 8 months ago
Evolving Output Codes for Multiclass Problems
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
Nicolás García-Pedrajas, Colin Fyfe