Results 11  20
of
427,428
Multiresolution Analysis of Arbitrary Meshes
, 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract

Cited by 605 (16 self)
 Add to MetaCart
in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a
TOWARDS A SAMPLING THEOREM FOR SIGNALS ON ARBITRARY GRAPHS
"... In this paper, we extend the NyquistShannon theory of sampling to signals defined on arbitrary graphs. Using spectral graph theory, we establish a cutoff frequency for all bandlimited graph signals that can be perfectly reconstructed from samples on a given subset of nodes. The result is analogous ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
In this paper, we extend the NyquistShannon theory of sampling to signals defined on arbitrary graphs. Using spectral graph theory, we establish a cutoff frequency for all bandlimited graph signals that can be perfectly reconstructed from samples on a given subset of nodes. The result
SOCLE THEORY FOR LEAVITT PATH ALGEBRAS OF ARBITRARY GRAPHS
, 2008
"... The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to characterize it, respectively. Leavitt path algebras with nonzero s ..."
Abstract
 Add to MetaCart
The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to characterize it, respectively. Leavitt path algebras with nonzero
Entanglement of ValenceBondSolid on an Arbitrary Graph
, 805
"... Abstract. The AffleckKennedyLiebTasaki (AKLT) spin interacting model can be defined on an arbitrary graph. We explain the construction of the AKLT Hamiltonian. Given certain conditions, the ground state is unique and known as the ValenceBondSolid (VBS) state. It can be used in measurementbased ..."
Abstract
 Add to MetaCart
Abstract. The AffleckKennedyLiebTasaki (AKLT) spin interacting model can be defined on an arbitrary graph. We explain the construction of the AKLT Hamiltonian. Given certain conditions, the ground state is unique and known as the ValenceBondSolid (VBS) state. It can be used in measurement
The Piecewise Smooth MumfordShah Functional on an Arbitrary Graph
"... Abstract—The MumfordShah functional has had a major impact on a variety of image analysis problems including image segmentation and filtering and, despite being introduced over two decades ago, it is still in widespread use. Present day optimization of the MumfordShah functional is predominated by ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
the corresponding MumfordShah functional on an arbitrary graph and apply the techniques of combinatorial optimization to produce a fast, lowenergy solution. In contrast to traditional optimization methods, use of these combinatorial techniques necessitates consideration of the reconstructed image outside of its
Network models in class C on arbitrary graphs
 Comm. Math. Phys
, 2005
"... We consider network models of quantum localisation in which a particle with a twocomponent wave function propagates through the nodes and along the edges of an arbitrary directed graph, subject to a random SU(2) rotation on each edge it traverses. The propagation through each node is specified by a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider network models of quantum localisation in which a particle with a twocomponent wave function propagates through the nodes and along the edges of an arbitrary directed graph, subject to a random SU(2) rotation on each edge it traverses. The propagation through each node is specified
Embedding arbitrary graphs of maximum degree two
 J. London Math. Soc
, 1993
"... Let S(H) be the minimum degree of the graph H. We prove that a graph H of order n with S(H) ^ (2n —1)/3 contains any graph G of order at most n and maximum degree A(G) < 2 as a subgraph, and this bound is best possible. Furthermore, this result settles the case A(G) = 2 of the wellknown conjec ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Let S(H) be the minimum degree of the graph H. We prove that a graph H of order n with S(H) ^ (2n —1)/3 contains any graph G of order at most n and maximum degree A(G) < 2 as a subgraph, and this bound is best possible. Furthermore, this result settles the case A(G) = 2 of the well
Selfstabilizing Vertex Coloring of Arbitrary Graphs
 IN 4TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS’2000
, 2000
"... A selfstabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit... ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
A selfstabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit...
How to Schedule a Cascade in an Arbitrary Graph
, 2012
"... When individuals in a social network make decisions that depend on what others have done earlier, there is the potential for a cascade to form — a run of behaviors that are highly correlated. In an arbitrary network, the outcome of such a cascade can depend sensitively on the order in which nodes ma ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
When individuals in a social network make decisions that depend on what others have done earlier, there is the potential for a cascade to form — a run of behaviors that are highly correlated. In an arbitrary network, the outcome of such a cascade can depend sensitively on the order in which nodes
Desynchronization for Sensor Networks with Arbitrary Graph Topology
, 2007
"... This project addresses the problem of distributed desynchronization of sensor networks with arbitrary graph topology. The motivation for desynchronization is wideranging, including the establishment of collisionfree communication windows, coordinated sleep schedules, task allocation, and periodi ..."
Abstract
 Add to MetaCart
This project addresses the problem of distributed desynchronization of sensor networks with arbitrary graph topology. The motivation for desynchronization is wideranging, including the establishment of collisionfree communication windows, coordinated sleep schedules, task allocation
Results 11  20
of
427,428