5055 search results - page 199 / 1011 » Relative Timing |
139
click to vote
MST
2006
15 years 6 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
149
Voted
PRESENCE
2006
15 years 6 months ago
2006
This paper is the first part of a two-part paper that documents a detailed survey of the research carried out on consistency and latency in distributed interactive applications (D...
203
click to vote
JCO
2007
15 years 6 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
176
Voted
JIPS
2008
15 years 6 months ago
2008
: This paper describes the design and implementation of a two-tier DBMS for handling massive data and providing faster response time. In the present day, the main requirements of D...
153
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In many applications, classifiers need to be built based on multiple related data streams. For example, stock streams and news streams are related, where the classification patter...