Sciweavers

3360 search results - page 40 / 672
» Opportunistic Data Structures with Applications
Sort
View
BMCBI
2008
93views more  BMCBI 2008»
15 years 2 months ago
Hybrid MM/SVM structural sensors for stochastic sequential data
In this paper we present preliminary results stemming from a novel application of Markov Models and Support Vector Machines to splice site classification of Intron-Exon and Exon-I...
Brian Roux, Stephen Winters-Hilt
SIGCOMM
2010
ACM
15 years 2 months ago
California fault lines: understanding the causes and impact of network failures
Of the major factors affecting end-to-end service availability, network component failure is perhaps the least well understood. How often do failures occur, how long do they last,...
Daniel Turner, Kirill Levchenko, Alex C. Snoeren, ...
COCOON
1998
Springer
15 years 6 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
HASKELL
2006
ACM
15 years 8 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
HPCA
2009
IEEE
16 years 2 months ago
Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
Eiman Ebrahimi, Onur Mutlu, Yale N. Patt