Sciweavers

2593 search results - page 75 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
POPL
2008
ACM
16 years 2 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
SAC
2006
ACM
15 years 8 months ago
Operating system multilevel load balancing
This paper describes an algorithm that allows Linux to perform multilevel load balancing in NUMA computers. The Linux scheduler implements a load balancing algorithm that uses str...
Mônica Corrêa, Avelino Francisco Zorzo...
ITA
2007
153views Communications» more  ITA 2007»
15 years 2 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
128
Voted
AMW
2010
15 years 4 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos
ECML
2007
Springer
15 years 8 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban