Sciweavers

666 search results - page 100 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
WEBI
2005
Springer
14 years 2 months ago
Improving Web Clustering by Cluster Selection
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
Daniel Crabtree, Xiaoying Gao, Peter Andreae
LICS
2008
IEEE
14 years 3 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 9 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan
FOCS
1997
IEEE
14 years 1 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 1 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger