4047 search results - page 266 / 810 » Some Properties and Some Problems on Set Functors |
158
click to vote
ICTCS
2005
Springer
16 years 1 hour ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
173
click to vote
CCCG
1998
15 years 7 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
198
click to vote
JMIV
2010
15 years 1 months ago
2010
Abstract We consider the problem of estimating the geometric deformation of an object, with respect to some reference observation on it. Existing solutions, set in the standard coo...
154
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...