Sciweavers

4536 search results - page 53 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ITA
2007
153views Communications» more  ITA 2007»
13 years 8 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...
AMW
2010
13 years 10 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
ATAL
2008
Springer
13 years 11 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose
EH
2004
IEEE
74views Hardware» more  EH 2004»
14 years 21 days ago
Sensory Channel Grouping and Structure from Uninterpreted Sensor Data
In this paper we focus on the problem of making a model of the sensory apparatus from raw uninterpreted sensory data as defined by Pierce and Kuipers (Artificial Intelligence 92:1...
Lars Olsson, Chrystopher L. Nehaniv, Daniel Polani
ICNP
2007
IEEE
14 years 3 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...