Sciweavers

2104 search results - page 38 / 421
» Sorting with networks of data structures
Sort
View
157
Voted
ICMCS
2008
IEEE
336views Multimedia» more  ICMCS 2008»
15 years 10 months ago
SIMD optimization of the H.264/SVC decoder with efficient data structure
H.264/scalable video coding (SVC) is a new compression technique that can adapt to various network environments and applications. However, despite its outstanding performance, H.2...
Joohyun Lee, Gwanggil Jeon, Sangjun Park, Taeyoung...
ACTA
2010
104views more  ACTA 2010»
15 years 4 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 5 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
DMS
2010
189views Multimedia» more  DMS 2010»
15 years 1 months ago
Visualizing the Commonalities Between Hierarchically Structured Data Queries
Abstract--In this paper we present an information visualization approach for visualizing the intersection between multiple feature hierarchies. In cases where a dataset has multipl...
Chad Jones, Ryan Armstrong, Kwan-Liu Ma
101
Voted
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
15 years 5 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...