Sciweavers

569 search results - page 97 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
BROADNETS
2004
IEEE
15 years 1 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
14 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
ICC
2009
IEEE
15 years 4 months ago
Robust Cyclic Space-Frequency Filtering for BICM-OFDM with Outdated CSIT
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
Harry Z. B. Chen, Robert Schober, Wolfgang H. Gers...
SUTC
2010
IEEE
15 years 1 months ago
A Log-Ratio Information Measure for Stochastic Sensor Management
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
Daniel Lyons, Benjamin Noack, Uwe D. Hanebeck