CVPR

2012

IEEE

12 years 8 days ago
2012

IEEE

Motion segmentation based on point trajectories can integrate information of a whole video shot to detect and separate moving objects. Commonly, similarities are deﬁned between ...

GC

2012

Springer

12 years 5 months ago
2012

Springer

A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...

IPPS

2010

IEEE

13 years 7 months ago
2010

IEEE

This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...

CORR

2010

Springer

13 years 8 months ago
2010

Springer

Given a hypergraph H = (V, E), a coloring of its vertices is said to be conﬂict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...

CIKM

2010

Springer

13 years 8 months ago
2010

Springer

In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...

ICDT

2010

ACM

13 years 8 months ago
2010

ACM

We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...

SIAMCOMP

2000

13 years 9 months ago
2000

Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...

COMBINATORICS

2000

13 years 9 months ago
2000

A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...

IPL

2006

13 years 9 months ago
2006

We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...

ARSCOM

2006

13 years 10 months ago
2006

In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...