2498 search results - page 223 / 500 » Data Structures with Unpredictable Timing |
111
click to vote
WSCG
2000
15 years 3 months ago
2000
In this paper, we present a fast watershed algorithm based on the rainfalling simulation. We present the various techniques and data structures utilized in our approach. Throughou...
155
click to vote
JOT
2008
15 years 2 months ago
2008
This paper describes how use the HTMLEditorKit to perform web data mining on stock statistics for listed firms. Our focus is on making use of the web to get information about comp...
133
click to vote
MEMOCODE
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
111
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
IPL
2010
15 years 29 days ago
2010
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...