Sciweavers

3946 search results - page 509 / 790
» The computational complexity of choice sets
Sort
View
3DPVT
2006
IEEE
167views Visualization» more  3DPVT 2006»
16 years 24 days ago
Hierarchical Representation of Virtual Cities for Progressive Transmission over Networks
Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientser...
Jérôme Royan, R. Balter, Christian Bo...
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
16 years 24 days ago
Range Image Registration Based on Circular Features
Range sensing technology allows the photo-realistic modeling of large-scale scenes, such as urban structures. A major bottleneck in the process of 3D scene acquisition is the auto...
Cecilia Chao Chen, Ioannis Stamos
SIGSOFT
2006
ACM
16 years 21 days ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
P2P
2005
IEEE
104views Communications» more  P2P 2005»
16 years 9 days ago
Range Queries in Trie-Structured Overlays
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
Anwitaman Datta, Manfred Hauswirth, Renault John, ...
DAWAK
2005
Springer
16 years 8 days ago
Automatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
Kamel Aouiche, Jérôme Darmont, Omar B...