32545 search results - page 270 / 6509 » Data Structures and Algorithms |
128
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
130
click to vote
SMC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— The underwater environment presents many challenges for robotic sensing including highly variable lighting, the presence of dynamic objects, and the six degree of freed...
142
Voted
ACHI
2009
IEEE
15 years 7 months ago
2009
IEEE
We present in this paper a web-based version of a Scrabble game, describing its architecture and some implementation details. This architecture makes possible a high degree of int...
159
click to vote
EGICE
2006
15 years 7 months ago
2006
System identification is an abductive task which is affected by several kinds of modeling assumptions and measurement errors. Therefore, instead of optimizing values of parameters ...
146
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...