7015 search results - page 10 / 1403 » Approximation algorithms for co-clustering |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
PODS
2012
ACM
11 years 10 months ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...