7930 search results - page 1483 / 1586 » Greedy in Approximation Algorithms |
168
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
128
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
129
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
129
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
129
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...