Results 1  10
of
649,209
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 2002
"... We propose a new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations. The proposed method is also a generalization of an active contour model without edges based 2phase segmentation, developed by ..."
Abstract

Cited by 500 (22 self)
 Add to MetaCart
the problems of vacuum and overlap; it needs only log n level set functions for n phases in the piecewise constant case; it can represent boundaries with complex topologies, including triple junctions; in the piecewise smooth case, only two level set functions formally suffice to represent any partition, based
Active Contours without Edges
, 2001
"... In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, MumfordShah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. We minimize an energy ..."
Abstract

Cited by 1209 (38 self)
 Add to MetaCart
an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "meancurvature flow"like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient
PARTITIVE CASE IN ESTONIAN AN ANALYSIS BY WAY OF MACROROLES
"... This paper presents a unified analysis of partitive casemarking in Estonian using the notion of macroroles, as employed in Role and Reference Grammar (RRG, Van Valin & LaPolla 1997). The partitive case has been described as a default objectmarking case in both Finnish and Estonian (Sulkala 199 ..."
Abstract
 Add to MetaCart
This paper presents a unified analysis of partitive casemarking in Estonian using the notion of macroroles, as employed in Role and Reference Grammar (RRG, Van Valin & LaPolla 1997). The partitive case has been described as a default objectmarking case in both Finnish and Estonian (Sulkala
Evolving Temporal Conceptual Schemas: The Partition Case
"... Abstract. In this paper we study temporal conceptual schema evolutions related to partitions, a typical and complex modeling construct. Using a previously defined framework based on a reflective architecture, we specify, only at conceptual level (and without descending to logical nor application lev ..."
Abstract
 Add to MetaCart
Abstract. In this paper we study temporal conceptual schema evolutions related to partitions, a typical and complex modeling construct. Using a previously defined framework based on a reflective architecture, we specify, only at conceptual level (and without descending to logical nor application
Epidemic routing for partiallyconnected ad hoc networks
, 2000
"... Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any preexisting network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination ..."
Abstract

Cited by 358 (0 self)
 Add to MetaCart
to destination. Given power limitations, the advent of shortrange wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where
Meshless methods: An overview and recent developments
 Computer Methods in Applied Mechanics and Engineering
, 1996
"... Meshless approximations based on moving least squares, kernels, and partitions of unity are examined. It is shown that the three methods are in most cases identical except for the important fact that partitions of unity enablepadaptivity to be achieved. Methods for constructing discontinuous approx ..."
Abstract

Cited by 334 (18 self)
 Add to MetaCart
Meshless approximations based on moving least squares, kernels, and partitions of unity are examined. It is shown that the three methods are in most cases identical except for the important fact that partitions of unity enablepadaptivity to be achieved. Methods for constructing discontinuous
Topologicallyaware overlay construction and server selection
, 2002
"... A number of largescale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the applicationlevel connectivity between ..."
Abstract

Cited by 340 (3 self)
 Add to MetaCart
between the nodes in these networks is congruent with the underlying IPlevel topology. Similarly, in the case of replicated web content, client nodes could use topological information in selecting one of multiple available servers. For such applications, one need not find the optimal solution in order
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2008
"... We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added ℓ1norm penalty term. The problem as formulated is convex but the memor ..."
Abstract

Cited by 332 (2 self)
 Add to MetaCart
but the memory requirements and complexity of existing interior point methods are prohibitive for problems with more than tens of nodes. We present two new algorithms for solving problems with at least a thousand nodes in the Gaussian case. Our first algorithm uses block coordinate descent, and can
Results 1  10
of
649,209