Sciweavers

231 search results - page 42 / 47
» Algorithms for Quantum Computation: Discrete Logarithms and ...
Sort
View
COMPGEOM
2010
ACM
14 years 17 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
14 years 4 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
TWC
2008
121views more  TWC 2008»
13 years 7 months ago
Optimal Downlink OFDMA Resource Allocation with Linear Complexity to Maximize Ergodic Rates
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...
Ian C. Wong, Brian L. Evans
JMLR
2012
11 years 10 months ago
A Stick-Breaking Likelihood for Categorical Data Analysis with Latent Gaussian Models
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
Mohammad Emtiyaz Khan, Shakir Mohamed, Benjamin M....
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt