56 search results - page 7 / 12 » O-Convexity Computing Hulls Approximations and Orientation S... |
137
click to vote
FOCS
2009
IEEE
16 years 23 days ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
152
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
Space-Partition Octree (SP-Octree) is a hierarchical representation scheme for solid modelling. It allows a multiresolution representation of polyhedral objects, and has been succ...
156
click to vote
ICTAI
2008
IEEE
16 years 13 days ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
168
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
197
click to vote
ICPR
2008
IEEE
16 years 14 days ago
2008
IEEE
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...