Sciweavers

3223 search results - page 527 / 645
» The Scaling of Search Cost
Sort
View
COMPGEOM
1998
ACM
14 years 16 days ago
Viewspace Partitioning of Densely Occluded Scenes
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicar...
WWCA
1998
Springer
14 years 15 days ago
Compact and Flexible Resolution of CBT Multicast Key-Distribution
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
Kanta Matsuura, Yuliang Zheng, Hideki Imai
CHI
1997
ACM
14 years 14 days ago
Artificial Intelligence Techniques in the Interface to a Digital Video Library
For the huge amounts of audio and video material that could usefully be included in digital libraries, the cost of producing human-generated annotations and meta-data is prohibiti...
Alexander G. Hauptmann, Michael J. Witbrock, Micha...
PDIS
1996
IEEE
14 years 13 days ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
VLDB
1994
ACM
129views Database» more  VLDB 1994»
14 years 11 days ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos