4212 search results - page 809 / 843 » On Compressible Pairings and Their Computation |
172
click to vote
CIKM
2009
Springer
16 years 21 days ago
2009
Springer
This paper presents a study of a novel summarization problem called contrastive opinion summarization (COS). Given two sets of positively and negatively opinionated sentences whic...
184
click to vote
FSTTCS
2009
Springer
16 years 21 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
173
click to vote
COMPGEOM
2009
ACM
16 years 20 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
180
click to vote
ISSTA
2009
ACM
16 years 19 days ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
185
click to vote
SIGCOMM
2009
ACM
16 years 19 days ago
2009
ACM
Online social networks have become extremely popular; numerous sites allow users to interact and share content using social links. Users of these networks often establish hundreds...