4198 search results - page 91 / 840 » In search of lost time |
149
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
139
click to vote
CN
2000
15 years 5 months ago
2000
The Stanford Power Browser project addresses the problems of interacting with the World-Wide Web through wirelessly connected Personal Digital Assistants (PDAs). These problems in...
151
click to vote
ISAAC
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
137
click to vote
WALCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
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...
256
click to vote
IR
2008
15 years 6 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...