Results 1  10
of
560
Tangencies between families of disjoint regions in the plane
, 2010
"... Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only assume that our sets are connected and vert ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only assume that our sets are connected
Disjoint Region Partitioning for Probabilistic Switching Activity Estimation at Register Transfer Level
, 2009
"... Abstract. This paper presents a partition method for probabilistic switching activity estimation of combinational circuits described at register transfer level (RTL). Probabilistic estimation of switching activity requires large and complex models that could be unfeasible for large circuits; theref ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
; therefore, circuit partitioning becomes a necessary step to address the analysis. Nevertheless, partition methods imply approximations that produce inaccurate results. We present a partition method based on disjoint signals that minimizes the error and, in addition, it is easy to carry out. Results show
Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory
 MATH. BIOSCI
, 1992
"... Given an amino acid sequence, we discuss how to find efficiently an optimal set of disjoint regions (substrings, domains, modules, etc.), each of which can be matched to some element of a predefined inventory containing, for example, consensus equences, protosequences, or protein family profiles. A ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Given an amino acid sequence, we discuss how to find efficiently an optimal set of disjoint regions (substrings, domains, modules, etc.), each of which can be matched to some element of a predefined inventory containing, for example, consensus equences, protosequences, or protein family profiles. A
Contour and Texture Analysis for Image Segmentation
, 2001
"... This paper provides an algorithm for partitioning grayscale images into disjoint regions of coherent brightness and texture. Natural images contain both textured and untextured regions, so the cues of contour and texture differences are exploited simultaneously. Contours are treated in the interveni ..."
Abstract

Cited by 404 (28 self)
 Add to MetaCart
This paper provides an algorithm for partitioning grayscale images into disjoint regions of coherent brightness and texture. Natural images contain both textured and untextured regions, so the cues of contour and texture differences are exploited simultaneously. Contours are treated
The SRtree: An Index Structure for HighDimensional Nearest Neighbor Queries
, 1997
"... Recently, similarity queries on feature vectors have been widely used to perform contentbased retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries e ciently. The SStree had been proposed for ..."
Abstract

Cited by 438 (3 self)
 Add to MetaCart
by the intersection of a bounding sphere and a bounding rectangle. Incorporating bounding rectangles permits neighborhoods to be partitioned into smaller regions than the SStree and improves the disjointness among regions. This enhances the performance on nearest neighbor queries especially for highdimensional
Concavity Cuts for Disjoint Bilinear Programming
 MATHEMATICAL PROGRAMMING
, 2001
"... We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin reformulations, leading to two sets of concavity cuts. We first examine the depth of these cuts by considering the assumptions on the boundedness ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin reformulations, leading to two sets of concavity cuts. We first examine the depth of these cuts by considering the assumptions on the boundedness
1Finding critical regions and regiondisjoint paths in a network
"... Abstract—Due to their importance to society, communication networks should be built and operated to withstand failures. However, cost considerations make network providers less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding sim ..."
Abstract
 Add to MetaCart
subsequently address the regiondisjoint paths problem, which asks for two paths with minimum total weight between a source (s) and a destination (d) that cannot both be cut by a single regional failure of diameter D (unless that failure includes s or d). We prove that deciding whether regiondisjoint paths
Textons, contours and regions: Cue integration in image segmentation
 In International Conference on Computer Vision
, 1999
"... This paper makes two contributions. It provides (1) an operational definition of textons, the putative elementary units of texture perception, and (2) an algorithm for partitioning the image into disjoint regions of coherent brightness and texture, where boundaries of regions are defined by peaks in ..."
Abstract

Cited by 111 (8 self)
 Add to MetaCart
This paper makes two contributions. It provides (1) an operational definition of textons, the putative elementary units of texture perception, and (2) an algorithm for partitioning the image into disjoint regions of coherent brightness and texture, where boundaries of regions are defined by peaks
Automatic Pool Allocation for Disjoint Data Structures
, 2002
"... This paper presents an analysis technique and a novel program transformation that can enable powerful optimizations for entire linked data structures. The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heapbased data structures. The transformation ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
This paper presents an analysis technique and a novel program transformation that can enable powerful optimizations for entire linked data structures. The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heapbased data structures. The transformation
Results 1  10
of
560