Sciweavers

1047 search results - page 69 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
IV
2000
IEEE
152views Visualization» more  IV 2000»
14 years 6 days ago
Effects of Desktop 3D World Design on User Navigation and Search Performance
Desktop virtual reality (VR) offers a powerful environment for visualizing structure in large information sets. In well-designed virtual worlds, users can employ skills from wayfi...
David Modjeska, John A. Waterworth
DAWAK
2005
Springer
14 years 1 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
DAWAK
2006
Springer
13 years 11 months ago
Efficient Mining of Large Maximal Bicliques
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
Guimei Liu, Kelvin Sim, Jinyan Li
IJCV
2002
227views more  IJCV 2002»
13 years 7 months ago
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
Abstract-- This paper presents an efficient implementation for correlation based stereo. Research in this area can roughly be divided in two classes: improving accuracy regardless ...
Karsten Mühlmann, Dennis Maier, Jürgen H...
IV
2010
IEEE
186views Visualization» more  IV 2010»
13 years 5 months ago
Visual Amortization Analysis of Recompilation Strategies
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...
Stephan Zimmer, Stephan Diehl