Sciweavers

7015 search results - page 142 / 1403
» Approximation algorithms for co-clustering
Sort
View
SODA
2000
ACM
109views Algorithms» more  SODA 2000»
13 years 10 months ago
Approximate congruence in nearly linear time
Piotr Indyk, Suresh Venkatasubramanian
SODA
1994
ACM
81views Algorithms» more  SODA 1994»
13 years 10 months ago
Approximately Counting Hamilton Cycles in Dense Graphs
Martin E. Dyer, Alan M. Frieze, Mark Jerrum
ESA
2010
Springer
144views Algorithms» more  ESA 2010»
13 years 10 months ago
Approximation Schemes for Multi-Budgeted Independence Systems
Fabrizio Grandoni, Rico Zenklusen
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 10 months ago
Yet another algorithm for dense max cut: go greedy
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
Claire Mathieu, Warren Schudy
SOFTWARE
2002
13 years 9 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni