Sciweavers

56 search results - page 7 / 12
» O-Convexity Computing Hulls Approximations and Orientation S...
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
On Allocating Goods to Maximize Fairness
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...
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khan...
CG
2005
Springer
13 years 7 months ago
Combining SP-Octrees and impostors for the visualisation of multiresolution models
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...
Francisco J. Melero, Pedro Cano, Juan Carlos Torre...
ICTAI
2008
IEEE
14 years 1 months ago
Computational Complexity of Web Service Composition Based on Behavioral Descriptions
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...
Hyunyoung Kil, Wonhong Nam, Dongwon Lee
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
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...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
ICPR
2008
IEEE
14 years 1 months ago
Approximation of salient contours in cluttered scenes
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...
Rui Huang, Nong Sang, Qiling Tang