Sciweavers

7913 search results - page 458 / 1583
» Information Collection on a Graph
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Digital Tapestry
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov,...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
16 years 5 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
COLT
2003
Springer
16 years 2 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
JWSR
2008
147views more  JWSR 2008»
15 years 6 months ago
Karma2: Provenance Management for Data-Driven Workflows
: The increasing ability for the sciences to sense the world around us is resulting in a growing need for data driven applications that are under the control of workflows composed ...
Yogesh L. Simmhan, Beth Plale, Dennis Gannon
NETWORKS
2010
15 years 5 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum