7379 search results - page 1415 / 1476 » How Many Clusters |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
ICFP
2010
ACM
13 years 11 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
MM
2010
ACM
13 years 10 months ago
2010
ACM
We revisit one of the most fundamental problems in multimedia that is receiving enormous attention from researchers without making much progress in solving it: the problem of brid...
RECSYS
2010
ACM
13 years 10 months ago
2010
ACM
Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links amongst users, the phenomenon of users associating th...
CCS
2010
ACM
13 years 10 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...