Sciweavers

2738 search results - page 308 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
BCB
2010
161views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
CIKM
2010
Springer
15 years 1 months ago
On bootstrapping recommender systems
Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more a...
Nadav Golbandi, Yehuda Koren, Ronny Lempel
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 29 days ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
TIT
2010
130views Education» more  TIT 2010»
15 years 28 days ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ICASSP
2011
IEEE
14 years 10 months ago
Distributed beamforming for multiuser peer-to-peer and multi-group multicasting relay networks
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
Nils Bornhorst, Marius Pesavento, Alex B. Gershman