Sciweavers

1871 search results - page 307 / 375
» The Ephemeral Pairing Problem
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
ICASSP
2011
IEEE
14 years 10 months ago
On the identification of parametric underspread linear systems
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...
Waheed U. Bajwa, Kfir Gedalyahu, Yonina C. Eldar
INFOCOM
2011
IEEE
14 years 10 months ago
Spherical representation and polyhedron routing for load balancing in wireless sensor networks
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
Xiaokang Yu, Xiaomeng Ban, Wei Zeng, Rik Sarkar, X...
ICALP
2011
Springer
14 years 10 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
IR
2011
14 years 9 months ago
Modeling score distributions in information retrieval
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
Avi Arampatzis, Stephen Robertson