Results 1  10
of
883,238
Edge Detection
, 1985
"... For both biological systems and machines, vision begins with a large and unwieldy array of measurements of the amount of light reflected from surfaces in the environment. The goal of vision is to recover physical properties of objects in the scene, such as the location of object boundaries and the s ..."
Abstract

Cited by 1277 (1 self)
 Add to MetaCart
and the structure, color and texture of object surfaces, from the twodimensional image that is projected onto the eye or camera. This goal is not achieved in a single step; vision proceeds in stages, with each stage producing increasingly more useful descriptions of the image and then the scene. The first clue
Hierarchically Classifying Documents Using Very Few Words
, 1997
"... The proliferation of topic hierarchies for text documents has resulted in a need for tools that automatically classify new documents within such hierarchies. Existing classification schemes which ignore the hierarchical structure and treat the topics as separate classes are often inadequate in text ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
The proliferation of topic hierarchies for text documents has resulted in a need for tools that automatically classify new documents within such hierarchies. Existing classification schemes which ignore the hierarchical structure and treat the topics as separate classes are often inadequate in text
On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs
"... Computing a minimum vertex cover in graphs and hypergraphs is a wellstudied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex cover is polynomial time solvable. In this work, we study the natural extension of bipartite vertex cover to hypergraphs, ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
, namely finding a small vertex cover in kuniform kpartite hypergraphs, when the kpartition is given as input. For this problem Lovász [16] gave a k 2 factor LP rounding based approximation, and a matching ( k 2 − o(1)) integrality gap instance was constructed by Aharoni et al. [1]. We prove
The Lifting Scheme: A Construction Of Second Generation Wavelets
, 1997
"... . We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads to ..."
Abstract

Cited by 541 (16 self)
 Add to MetaCart
. We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads
D.: Embeddings and Ramsey numbers of sparse kuniform hypergraphs, Combinatorica 29
, 2009
"... Abstract. Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [5, 19] the same result was proved for 3uniform hypergraphs. Here we extend this result to kuniform hypergraphs for any integer k ≥ 3. As in the 3uni ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
Abstract. Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [5, 19] the same result was proved for 3uniform hypergraphs. Here we extend this result to kuniform hypergraphs for any integer k ≥ 3. As in the 3
Loose Hamilton Cycles in Random kUniform Hypergraphs
, 2010
"... In the random hypergraph Hn,p;k each possible ktuple appears independently with probability p. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if pn k−1 / log n tends to infinity with n then lim Pr(Hn,p;k contains a loose Hamilton ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In the random hypergraph Hn,p;k each possible ktuple appears independently with probability p. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if pn k−1 / log n tends to infinity with n then lim Pr(Hn,p;k contains a loose
Towards Community Detection in kPartite kUniform Hypergraphs
"... Recently, numerous applications have emerged that create data most naturally interpreted as kpartite kuniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a hy ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Recently, numerous applications have emerged that create data most naturally interpreted as kpartite kuniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a
Results 1  10
of
883,238