Sciweavers

CVPR
2012
IEEE
12 years 8 days ago
Higher order motion models and spectral clustering
Motion segmentation based on point trajectories can integrate information of a whole video shot to detect and separate moving objects. Commonly, similarities are defined between ...
Peter Ochs, Thomas Brox
GC
2012
Springer
12 years 5 months ago
Covering Complete Hypergraphs with Cuts of Minimum Total Size
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 ...
Sebastian M. Cioaba, André Kündgen
IPPS
2010
IEEE
13 years 7 months ago
Hypergraph-based task-bundle scheduling towards efficiency and fairness in heterogeneous distributed systems
This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...
Han Zhao, Xinxin Liu, Xiaolin Li
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Choosability in geometric hypergraphs
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
Panagiotis Cheilaris, Shakhar Smorodinsky
CIKM
2010
Springer
13 years 8 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
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...
Haw-ren Fang, Yousef Saad
ICDT
2010
ACM
137views Database» more  ICDT 2010»
13 years 8 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
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...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 9 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
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...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
13 years 9 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
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 ...
Martin Klazar
IPL
2006
105views more  IPL 2006»
13 years 9 months ago
Finding and counting cliques and independent sets in r-uniform hypergraphs
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...
Raphael Yuster
ARSCOM
2006
132views more  ARSCOM 2006»
13 years 10 months ago
C-Perfect K-Uniform Hypergraphs
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 ...
Changiz Eslahchi, Arash Rafiey