7006 search results - page 1304 / 1402 » Approximation Algorithms |
104
Voted
KDD
2007
ACM
16 years 1 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...
104
Voted
KDD
2006
ACM
16 years 1 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...
102
Voted
STOC
2005
ACM
16 years 1 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...
123
click to vote
SIGMOD
2004
ACM
16 years 29 days ago
2004
ACM
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
172
Voted
SIGMOD
2004
ACM
16 years 29 days ago
2004
ACM
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...