Sciweavers

59 search results - page 8 / 12
» Red-blue covering problems and the consecutive ones property
Sort
View
WSCG
2004
156views more  WSCG 2004»
13 years 8 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
WSCG
2004
166views more  WSCG 2004»
13 years 8 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
ACL
1998
13 years 8 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
COLOGNETWENTE
2008
13 years 8 months ago
Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
Céline Engelbeen, Samuel Fiorini
COLT
2003
Springer
14 years 17 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan