Results 1 - 10 of 1,189

Disjoint, Partition and Intersection Constraints for Set and Multiset Variables

by Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh - In CP-04 , 2004
"... We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. ..."
Abstract - Cited by 17 (2 self) - Add to MetaCart
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints.

The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries

by Norio Katayama, et al. , 1997
"... Recently, similarity queries on feature vectors have been widely used to perform content-based 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 SS-tree 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 SS-tree and improves the disjointness among regions. This enhances the performance on nearest neighbor queries especially for highdimensional

Contour and Texture Analysis for Image Segmentation

by Jitendra Malik, Serge Belongie, Thomas Leung, Jianbo Shi , 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 adaptive nature of human categorization

by John R. Anderson - Psychological Review , 1991
"... A rational model of human categorization behavior is presented that assumes that categorization reflects the derivation of optimal estimates of the probability of unseen features of objects. A Bayesian analysis is performed of what optimal estimations would be if categories formed a disjoint partiti ..."
Abstract - Cited by 344 (2 self) - Add to MetaCart
A rational model of human categorization behavior is presented that assumes that categorization reflects the derivation of optimal estimates of the probability of unseen features of objects. A Bayesian analysis is performed of what optimal estimations would be if categories formed a disjoint

Disjoint pattern database heuristics

by Ariel Felner, Richard E. Korf, Sarit Hanan - Artificial Intelligence , 2002
"... We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases (Culberson & Schaeffer, 1998), which are precomputed tables of the exact cost of solving various subproblems of an existing problem. Unlike standard pattern database heu ..."
Abstract - Cited by 141 (36 self) - Add to MetaCart
heuristics, however, we partition our problems into disjoint subproblems, so that the costs of solving the different subproblems can be added together without overestimating the cost of solving the original problem. Previously (Korf & Felner, 2002) we showed how to statically partition the sliding

Skipnet: A scalable overlay network with practical locality properties

by Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman , 2003
"... Abstract: Scalable overlay networks such as Chord, Pastry, and Tapestry have recently emerged as a flexible infrastructure for building large peer-to-peer systems. In practice, two disadvantages of such systems are that it is difficult to control where data is stored and difficult to guarantee that ..."
Abstract - Cited by 359 (5 self) - Add to MetaCart
placement, where content can be placed either on a pre-determined node or distributed uniformly across the nodes of a hierarchical naming subtree. An additional useful consequence of SkipNet’s locality properties is that partition failures, in which an entire organization disconnects from the rest

Disjoint products and S-partitions

by Lorenzo Traldi , 2001
"... Sum of disjoint products (SDP) algorithms analyze network reliability by producing partitions, and S-partitions are certain partitions which generalize shellings. Existing SDP algorithms without multiple-variable inversion produce S-partitions, so S-partitions provide a theoretical framework in whic ..."
Abstract - Add to MetaCart
Sum of disjoint products (SDP) algorithms analyze network reliability by producing partitions, and S-partitions are certain partitions which generalize shellings. Existing SDP algorithms without multiple-variable inversion produce S-partitions, so S-partitions provide a theoretical framework

Blind separation of speech mixtures via time-frequency masking

by Özgür Yılmaz, Scott Rickard - IEEE TRANSACTIONS ON SIGNAL PROCESSING (2002) SUBMITTED , 2004
"... Binary time-frequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary time-frequency masks is possible provided the time-frequency representations of the sources do not overlap: a condition we call-disjoint orthogonality. We introduce here t ..."
Abstract - Cited by 322 (5 self) - Add to MetaCart
Binary time-frequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary time-frequency masks is possible provided the time-frequency representations of the sources do not overlap: a condition we call-disjoint orthogonality. We introduce here

Efficient Algorithms for Mining Outliers from Large Data Sets

by Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim , 2000
"... In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its k th nearest neighbor. We rank each point on the basis of its distance to its k th nearest neighbor and declare the top n points in this ranking to be outliers. In addition ..."
Abstract - Cited by 322 (0 self) - Add to MetaCart
. In addition to developing relatively straightforward solutions to finding such outliers based on the classical nestedloop join and index join algorithms, we develop a highly efficient partition-based algorithm for mining outliers. This algorithm first partitions the input data set into disjoint subsets

Disjoint dijoins

by Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul Seymour
"... A “dijoin” in a digraph is a set of edges meeting every directed cut. D. R. Woodall conjectured in 1976 that if G is a digraph, and every directed cut of G has at least k edges, then there are k pairwise disjoint dijoins. This remains open, but a capacitated version is known to be false. In particul ..."
Abstract - Add to MetaCart
A “dijoin” in a digraph is a set of edges meeting every directed cut. D. R. Woodall conjectured in 1976 that if G is a digraph, and every directed cut of G has at least k edges, then there are k pairwise disjoint dijoins. This remains open, but a capacitated version is known to be false
Results 1 - 10 of 1,189