Sciweavers

85 search results - page 12 / 17
» Scaling limit of random k-trees
Sort
View
WWW
2010
ACM
16 years 1 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
CISS
2008
IEEE
16 years 28 days ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk
ICASSP
2010
IEEE
15 years 6 months ago
Feedback reduction in MIMO broadcast channels with LMMSE receivers
In this paper we analyze the performance of random beamforming schemes in a multi-user Gaussian broadcast channel. Each user will have N > 1 receive antennas allowing optimal c...
Matthew Pugh, Bhaskar D. Rao
AUTOMATICA
2008
104views more  AUTOMATICA 2008»
15 years 6 months ago
Communication constraints in the average consensus problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of aut...
Ruggero Carli, Fabio Fagnani, Alberto Speranzon, S...
ICASSP
2008
IEEE
16 years 27 days ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...