Results 11  20
of
3,746
Finding Large Independent Sets of Hypergraphs in Parallel
"... A basic problem in hypergraphs is that of finding a large independent set–one of guaranteed size–in a given hypergraph. Understanding the parallel complexity of this and related independent set problems on hypergraphs is a fundamental open issue in parallel computation. Caro and Tuza (J. Graph Theor ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A basic problem in hypergraphs is that of finding a large independent set–one of guaranteed size–in a given hypergraph. Understanding the parallel complexity of this and related independent set problems on hypergraphs is a fundamental open issue in parallel computation. Caro and Tuza (J. Graph
Scene completion using millions of photographs
 ACM Transactions on Graphics (SIGGRAPH
, 2007
"... Figure 1: Given an input image with a missing region, we use matching scenes from a large collection of photographs to complete the image. What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. ..."
Abstract

Cited by 251 (12 self)
 Add to MetaCart
image completion tasks we are able to find similar scenes which contain image fragments that will convincingly complete the image. Our algorithm is entirely datadriven, requiring no annotations or labelling by the user. Unlike existing image completion methods, our algorithm can generate a diverse set
A scalable algorithm for answering queries using views
 In Proc. of VLDB
, 2000
"... The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database relations. The problem has received significant attention because of its relevance to a wide variety of da ..."
Abstract

Cited by 249 (7 self)
 Add to MetaCart
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database relations. The problem has received significant attention because of its relevance to a wide variety
Multiplexed protein quantitation in Saccharomyces cerevisiae using aminereactive isobaric tagging reagents,”
 Molecular and Cellular Proteomics,
, 2004
"... We describe here a multiplexed protein quantitation strategy that provides relative and absolute measurements of proteins in complex mixtures. At the core of this methodology is a multiplexed set of isobaric reagents that yield aminederivatized peptides. The derivatized peptides are indistinguisha ..."
Abstract

Cited by 248 (1 self)
 Add to MetaCart
We describe here a multiplexed protein quantitation strategy that provides relative and absolute measurements of proteins in complex mixtures. At the core of this methodology is a multiplexed set of isobaric reagents that yield aminederivatized peptides. The derivatized peptides
Automated Extraction and Parameterization of Motions in Large Data Sets
 ACM Transactions on Graphics
, 2004
"... Large motion data sets often contain many variants of the same kind of motion, but without appropriate tools it is difficult to fully exploit this fact. This paper provides automated methods for identifying logically similar motions in a data set and using them to build a continuous and intuitively ..."
Abstract

Cited by 183 (2 self)
 Add to MetaCart
Large motion data sets often contain many variants of the same kind of motion, but without appropriate tools it is difficult to fully exploit this fact. This paper provides automated methods for identifying logically similar motions in a data set and using them to build a continuous and intuitively
A levelset approach to 3d reconstruction from range data
 International Journal of Computer Vision
, 1998
"... This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a statistical problem: find that surface which is mostly likely, given the data and some prior knowledge about the application d ..."
Abstract

Cited by 195 (24 self)
 Add to MetaCart
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a statistical problem: find that surface which is mostly likely, given the data and some prior knowledge about the application
Probabilistic Graph and Hypergraph Matching
"... We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph where the complex relations are represented by hyperedges. A match between the feature sets is then modeled as a hypergr ..."
Abstract

Cited by 67 (0 self)
 Add to MetaCart
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph where the complex relations are represented by hyperedges. A match between the feature sets is then modeled as a
On Markov chains for independent sets
 Journal of Algorithms
, 1997
"... Random independent sets in graphs arise, for example, in statistical physics, in the hardcore model of a gas. A new rapidly mixing Markov chain for independent sets is defined in this paper. We show that it is rapidly mixing for a wider range of values of the parameter than the LubyVigoda chain, ..."
Abstract

Cited by 82 (17 self)
 Add to MetaCart
, the best previously known. Moreover the new chain is apparently more rapidly mixing than the LubyVigoda chain for larger values of (unless the maximum degree of the graph is 4). An extension of the chain to independent sets in hypergraphs is described. This chain gives an efficient method
On Computing Maximal Independent Sets of Hypergraphs in Parallel
"... Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the wellunderstood case of MIS in graphs, for the hypergraph problem, our knowledge is quite limited despite considerable w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the wellunderstood case of MIS in graphs, for the hypergraph problem, our knowledge is quite limited despite considerable
Results 11  20
of
3,746