Sciweavers

3628 search results - page 518 / 726
» The Decision Diffie-Hellman Problem
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
A Lagrangian dual relaxation approach to ML MIMO detection: Reinterpreting regularized lattice decoding
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
Jiaxian Pan, Wing-Kin Ma
ICASSP
2011
IEEE
14 years 8 months ago
Sensing-aware classification with high-dimensional data
In many applications decisions must be made about the state of an object based on indirect noisy observation of highdimensional data. An example is the determination of the presen...
Burkay Orten, Prakash Ishwar, W. Clem Karl, Venkat...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 5 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 4 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 4 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl