Sciweavers

78 search results - page 6 / 16
» Large Equiangular Sets of Lines in Euclidean Space
Sort
View
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 19 days ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
DEBU
2002
97views more  DEBU 2002»
13 years 7 months ago
Towards Increasingly Update Efficient Moving-Object Indexing
Current moving-object indexing concentrates on point-objects capable of continuous movement in one-, two-, and three-dimensional Euclidean spaces, and most approaches are based on...
Christian S. Jensen, Simonas Saltenis
ICIP
2003
IEEE
14 years 9 months ago
Kernel indexing for relevance feedback image retrieval
Relevance feedback is an attractive approach to developing flexible metrics for content-based retrieval in image and video databases. Large image databases require an index struct...
Jing Peng, Douglas R. Heisterkamp
APVIS
2009
13 years 8 months ago
Point-based tree representation: A new approach for large hierarchies
Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose a new app...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
TVCG
2011
132views more  TVCG 2011»
13 years 2 months ago
Point-Based Visualization for Large Hierarchies
—Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose an ef...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...