Sciweavers

145 search results - page 7 / 29
» Extended skew partition problem
Sort
View
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 7 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
DBSEC
2010
137views Database» more  DBSEC 2010»
13 years 9 months ago
Constructing Key Assignment Schemes from Chain Partitions
Abstract. In considering a problem in access control for scalable multimedia formats, we have developed new methods for constructing a key assignment scheme. Our first contribution...
Jason Crampton, Rosli Daud, Keith M. Martin
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
13 years 9 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
CCCG
2007
13 years 9 months ago
Optimal Point Set Partitioning using Rigid Motion Star Placement
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
Prosenjit Bose, Jason Morrison
OL
2010
140views more  OL 2010»
13 years 2 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...