Sciweavers

3946 search results - page 667 / 790
» The computational complexity of choice sets
Sort
View
SG
2009
Springer
15 years 11 months ago
User-Centered Development of a Visual Exploration System for In-Car Communication
Abstract. Modern premium automobiles are equipped with an increasing number of Electronic Control Units (ECUs). These ECUs are interconnected and form a complex network to provide ...
Michael Sedlmair, Benjamin Kunze, Wolfgang Hinterm...
EVOW
2001
Springer
15 years 11 months ago
Autonomous Photogrammetric Network Design Using Genetic Algorithms
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
Gustavo Olague
VVS
2000
IEEE
130views Visualization» more  VVS 2000»
15 years 11 months ago
A practical evaluation of popular volume rendering algorithms
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
Michael Meißner, Jian Huang, Dirk Bartz, Kla...
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 10 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
ERCIMDL
1999
Springer
117views Education» more  ERCIMDL 1999»
15 years 10 months ago
Predicting Indexer Performance in a Distributed Digital Library
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
Naomi Dushay, James C. French, Carl Lagoze