Sciweavers

11211 search results - page 118 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICPR
2002
IEEE
16 years 1 months ago
Fusion of Range and Visual Data for the Extraction of Scene Structure Information
In this paper, a method for inferring 3D structure information based on both range and visual data is proposed. Data fusion is achieved by validating assumptions formed according ...
Haris Baltzakis, Antonis A. Argyros, Panos E. Trah...
87
Voted
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 6 months ago
The Stardinates - Visualizing Highly Structured Data
The Stardinates are a novel interactive Information Visualization (InfoVis) technique which aims at visualizing highly structured data. They represent some Gestalt principles very...
Monika Lanzenberger, Silvia Miksch, Margit Pohl
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 2 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
118
Voted
BMCBI
2006
159views more  BMCBI 2006»
15 years 25 days ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 5 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer