1369 search results - page 182 / 274 » Lattice computations for random numbers |
BIOCOMP
2007
13 years 10 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ď...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
ICALP
2011
Springer
13 years 21 days ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...