600 search results - page 63 / 120 » Problems and results in extremal combinatorics - II |
197
click to vote
TWC
2010
15 years 1 months ago
2010
We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sugge...
340
click to vote
IPMI
2011
Springer
14 years 10 months ago
2011
Springer
Many current medical image analysis problems involve learning thousands or even millions of model parameters from extremely few samples. Employing sparse models provides an effecti...
157
click to vote
COCOON
2005
Springer
16 years 9 days ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
169
click to vote
COMPGEOM
2003
ACM
16 years 16 hour ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
191
Voted
IPL
2007
15 years 6 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...