Sciweavers

426 search results - page 71 / 86
» Structuring and merging Distributed Content
Sort
View
DAGSTUHL
2004
15 years 1 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
OAS
2003
15 years 1 months ago
Experiences with Ontology Development for Value-Added Publishing
This paper presents our practical experience of developing an ontology using the EXPLODE method for Value-Added Publishing. Value-Added Publishing is a relatively new area of elec...
Maia Hristozova, Leon Sterling
OSDI
1994
ACM
15 years 1 months ago
Experiences with Locking in a NUMA Multiprocessor Operating System Kernel
We describe the lockingarchitecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel lockingtechni...
Ronald C. Unrau, Orran Krieger, Benjamin Gamsa, Mi...
NGC
2002
Springer
103views Communications» more  NGC 2002»
14 years 11 months ago
An Evaluation of Topology-sensitive Subgroup Communication Mechanism in Large-scale Multicast Applications
Abundant content, data type and diverse members' interests naturally lead to preference heterogeneity within a multicast session requiring frequent communication within subgr...
Jangwon Lee, Gustavo de Veciana
ICMCS
2010
IEEE
121views Multimedia» more  ICMCS 2010»
14 years 10 months ago
Estimating cinematographic scene depth in movie shots
In film-making, the distance from the camera to the subject greatly affects the narrative power of a shot. By the alternate use of Long shots, Medium and Close-ups the director i...
Sergio Benini, Luca Canini, Riccardo Leonardi