Sciweavers

71228 search results - page 138 / 14246
» Algorithms
Sort
View
STOC
2002
ACM
81views Algorithms» more  STOC 2002»
16 years 1 months ago
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis...
PODS
2008
ACM
153views Database» more  PODS 2008»
16 years 1 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
ICSE
2003
IEEE-ACM
16 years 1 months ago
Precise Dynamic Slicing Algorithms
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
ICHIT
2009
Springer
15 years 8 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
15 years 8 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo
« Prev « First page 138 / 14246 Last » Next »