Sciweavers

2031 search results - page 138 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
15 years 2 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner
PODS
1993
ACM
161views Database» more  PODS 1993»
15 years 2 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
DAGM
2007
Springer
15 years 1 months ago
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
CIKM
2006
Springer
15 years 1 months ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...
ECML
2006
Springer
15 years 1 months ago
Transductive Gaussian Process Regression with Automatic Model Selection
Abstract. In contrast to the standard inductive inference setting of predictive machine learning, in real world learning problems often the test instances are already available at ...
Quoc V. Le, Alexander J. Smola, Thomas Gärtne...