Sciweavers

1203 search results - page 182 / 241
» Probabilistic Matrix Factorization
Sort
View
FOCS
2005
IEEE
14 years 3 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
KDD
2010
ACM
286views Data Mining» more  KDD 2010»
13 years 8 months ago
Nonnegative shared subspace learning and its application to social media retrieval
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
Sunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Tru...
MOBIHOC
2005
ACM
14 years 9 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
FOCS
2008
IEEE
14 years 4 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
OOPSLA
2005
Springer
14 years 3 months ago
Estimating software based on use case points
It is well documented that software product cost estimates are notoriously inaccurate across the software industry. Creating accurate cost estimates for software product developme...
Edward R. Carroll