7129 search results - page 1321 / 1426 » Approximation Algorithms for Treewidth |
KDD
2007
ACM
15 years 10 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...
KDD
2006
ACM
15 years 10 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...
STOC
2007
ACM
15 years 10 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...
STOC
2005
ACM
15 years 10 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...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...