2694 search results - page 480 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
118
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
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...
129
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
148
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
150
Voted
SIGIR
2011
ACM
14 years 5 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
116
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...