Results 1  10
of
1,249,306
Random Walk on an Arbitrary Set
"... Let I be a countably infinite set of points in R, and suppose that I has no points of accumulation and that its convex hull is the whole of R. It will be convenient to index I as {ui: i ∈ Z}, with ui < ui+1 for every i. Consider a continuoustime Markov chain Y = {Y (t) : t ≥ 0} on I, with the pr ..."
Abstract
 Add to MetaCart
Let I be a countably infinite set of points in R, and suppose that I has no points of accumulation and that its convex hull is the whole of R. It will be convenient to index I as {ui: i ∈ Z}, with ui < ui+1 for every i. Consider a continuoustime Markov chain Y = {Y (t) : t ≥ 0} on I
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
ABSTRACT FACTORIALS OF ARBITRARY SETS OF INTEGERS
, 2007
"... Given any subset of Z we associate to it another set on which we can define one or more (generally independent) abstract factorial functions. These associated sets are studied and arithmetic relations are revealed. In addition, we show that for an abstract factorial function of an infinite subset ..."
Abstract
 Add to MetaCart
Given any subset of Z we associate to it another set on which we can define one or more (generally independent) abstract factorial functions. These associated sets are studied and arithmetic relations are revealed. In addition, we show that for an abstract factorial function of an infinite subset
The Characteristic Mapping Method for the Linear Advection of Arbitrary Sets
"... In this paper, we present a new numerical method for advecting arbitrary sets in a vector field. The method computes a transformation of the domain instead of dealing with particular sets. We propose a way of decoupling the advection and representation steps of the computations, resulting in signifi ..."
Abstract
 Add to MetaCart
In this paper, we present a new numerical method for advecting arbitrary sets in a vector field. The method computes a transformation of the domain instead of dealing with particular sets. We propose a way of decoupling the advection and representation steps of the computations, resulting
Fast approximate energy minimization via graph cuts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract

Cited by 2127 (61 self)
 Add to MetaCart
very large moves are allowed. The first move we consider is an αβswap: for a pair of labels α, β, this move exchanges the labels between an arbitrary set of pixels labeled α and another arbitrary set labeled β. Our first algorithm generates a labeling such that there is no swap move that decreases
General Characterizations of inductive Inference over Arbitrary Sets of Data Presentations
"... General characterizations of inductive inference over arbitrary sets of data presentations ..."
Abstract
 Add to MetaCart
General characterizations of inductive inference over arbitrary sets of data presentations
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NP
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
, 2008
"... The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of nonadaptive linear measurements, under appropriate conditions on the measurement matrix. The vector model has been ext ..."
Abstract

Cited by 100 (42 self)
 Add to MetaCart
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of nonadaptive linear measurements, under appropriate conditions on the measurement matrix. The vector model has been
Multiresolution Analysis for Surfaces Of Arbitrary . . .
, 1993
"... Multiresolution analysis provides a useful and efficient tool for representing shape and analyzing features at multiple levels of detail. Although the technique has met with considerable success when applied to univariate functions, images, and more generally to functions defined on lR , to our k ..."
Abstract

Cited by 390 (3 self)
 Add to MetaCart
knowledge it has not been extended to functions defined on surfaces of arbitrary genus. In this
Shape modeling with front propagation: A level set approach
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... Abstract Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods ..."
Abstract

Cited by 804 (20 self)
 Add to MetaCart
secting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a “HamiltonJacob? ’ type equation written for a function in which the interface is a particular level set. A speed term synthesizpd from the image is used to stop the interface
Results 1  10
of
1,249,306