Sciweavers

1888 search results - page 267 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 11 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
INFOCOM
2005
IEEE
14 years 2 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
DAGSTUHL
2010
13 years 10 months ago
Towards Automatic Feature-based Visualization
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
Heike Jänicke, Gerik Scheuermann
IJON
2010
189views more  IJON 2010»
13 years 7 months ago
Inference and parameter estimation on hierarchical belief networks for image segmentation
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...
Christian Wolf, Gérald Gavin
VIS
2007
IEEE
144views Visualization» more  VIS 2007»
14 years 10 months ago
Enhancing Depth-Perception with Flexible Volumetric Halos
Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, su...
Stefan Bruckner, M. Eduard Gröller