Sciweavers

2883 search results - page 295 / 577
» Algorithms for merged indexes
Sort
View
DAGSTUHL
2004
15 years 7 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...
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
15 years 7 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
CSCW
2002
ACM
15 years 5 months ago
On the recommending of citations for research papers
Collaborative filtering has proven to be valuable for recommending items in many different domains. In this paper, we explore the use of collaborative filtering to recommend resea...
Sean M. McNee, Istvan Albert, Dan Cosley, Prateep ...
GRAPHICSINTERFACE
2009
15 years 3 months ago
Recognizing interspersed sketches quickly
Sketch recognition is the automated recognition of hand-drawn diagrams. When allowing users to sketch as they would naturally, users may draw shapes in an interspersed manner, sta...
Tracy Anne Hammond, Randall Davis
SIGCOMM
2010
ACM
15 years 6 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...