2498 search results - page 234 / 500 » Data Structures with Unpredictable Timing |
126
Voted
ICCSA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
133
click to vote
PPSWR
2005
Springer
15 years 8 months ago
2005
Springer
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
137
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
127
Voted
SWAT
1992
Springer
15 years 6 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
213
Voted
IR
2008
15 years 2 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...