Sciweavers

302 search results - page 6 / 61
» Intersecting with Unaware Objects
Sort
View
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
14 years 8 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
ADCM
2007
100views more  ADCM 2007»
14 years 10 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
CAMP
2000
IEEE
15 years 2 months ago
Homography Based Parallel Volume Intersection: Toward Real-Time Volume Reconstruction using Active Cameras
Silhouette volume intersection is one of the most popular ideas for reconstructing the 3D volume of an object from multi-viewpoint silhouette images. This paper presents a novel p...
Toshikazu Wada, Xiaojun Wu, Shogo Tokai, Takashi M...
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
14 years 5 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 3 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...