11213 search results - page 219 / 2243 » Low-contention data structures |
170
click to vote
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
136
click to vote
SODA
2010
ACM
15 years 3 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 ...
104
click to vote
ROBOCUP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper proposes a novel method for supervised classification based on the methodology of Q-analysis. The classification is based on finding ‘relevant’ structur...
142
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
A large number of data mining methods are, as such, not applicable to fast, intuitive, and interactive use. Thus, there is a need for visually controllable data mining methods. Suc...
157
click to vote
CSFW
2011
IEEE
14 years 4 months ago
2011
IEEE
—This paper introduces YARRA, a conservative extension to C to protect applications from non-control data attacks. YARRA programmers specify their data integrity requirements by ...