CS Store Search
Displaying 1-8 out of 8 total
Cheap silicon: a myth or reality? picking the right data plane hardware for software defined networking
Found in: Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking (HotSDN '13)
By Gergely Pongrácz, László Molnár, Zoltán Lajos Kis, Zoltán Turányi
Issue Date:August 2013
Software-Defined Networking (SDN) promises the vision of more flexible and manageable networks, but requires certain level of programmability in the data plane. Current industry insight holds that programmable network processors are of lower performance th...
Extending the PCRE Library with Static Backtracking Based Just-in-Time Compilation Support
Found in: Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO '14)
By Zoltán Herczeg
Issue Date:February 2014
High matching performance of regular expressions is a critical requirement for many widely used software tools today, including web servers, firewalls, and intrusion detection systems. Backtracking regular expression engines have been considerably improved...
Tangible tabletops for emergency response: an exploratory study
Found in: Proceedings of the International Conference on Multimedia, Interaction, Design and Innovation (MIDI '13)
By Ali Alavi, Andreas Kunz, Asim Evren Yantaç, Jonas Landgren, Morten Fjeld, Paweł Woźniak, Zoltán Sárosi
Issue Date:June 2013
Effective handling of location-based data is important to emergency response management (ERM). Expert team members co-located around maps typically discuss events while drawing freeform areas or while using physical placeholders representing incidents. Key...
CoARX: a coprocessor for ARX-based cryptographic algorithms
Found in: Proceedings of the 50th Annual Design Automation Conference (DAC '13)
By Anupam Chattopadhyay, Ayesha Khalid, Zoltán Endre Rákossy
Issue Date:May 2013
Cryptographic coprocessors are inherent part of modern System-on-Chips. It serves dual purpose - efficient execution of cryptographic kernels and supporting protocols for preventing IP-piracy. Flexibility in such coprocessors is required to provide protect...
Securing mobile agents for crisis management support
Found in: Proceedings of the seventh ACM workshop on Scalable trusted computing (STC '12)
By Daniel M. Hein, Emil Gatial, Hans Brandl, Ladislav Hluchý, Martin Pirker, Ronald Toegl, Zoltán Balogh
Issue Date:October 2012
Supporting emergency responders with mobile software agents promise increasing the efficiency of crisis management. While mobile agents offer many advantages, they also pose new challenges to security. However, security is a key prerequisite in crisis situ...
Rule-based assignment of comments to AST nodes in C++ programs
Found in: Proceedings of the Fifth Balkan Conference in Informatics (BCI '12)
By Tamás Cséri, Zalán Szügyi, Zoltán Porkoláb
Issue Date:September 2012
Comments are essential components of programming languages: they preserve the developer's intentions, help the maintainers to understand hidden concepts, and may act as a source of automatic documentation generation. However most of the software maintenanc...
Interactive visual analysis of families of curves using data aggregation and derivation
Found in: Proceedings of the 12th International Conference on Knowledge Management and Knowledge Technologies (i-KNOW '12)
By Alan Lež, Helwig Hauser, Krešimir Matković, Mario Jelović, Zoltán Konyha
Issue Date:September 2012
Time-series data are regularly collected and analyzed in a wide range of domains. Multiple simulation runs or multiple measurements of the same physical quantity result in ensembles of curves which we call families of curves. The analysis of time-series da...
Making sense of top-k matchings: a unified match graph for schema matching
Found in: Proceedings of the Ninth International Workshop on Information Integration on the Web (IIWeb '12)
By Avigdor Gal, Eliezer Levy, Matthias Weidlich, Nguyen Quoc Viet Hung, Tomer Sagi, Victor Shafran, Zoltán Miklós
Issue Date:May 2012
Schema matching in uncertain environments faces several challenges, among them the identification of complex correspondences. In this paper, we present a method to address this challenge based on top-k matchings, i.e., a set of matchings comprising only 1:...
Original Search Engine
Need a Web Account?
Become a Member
This site and all contents (unless otherwise noted) are Copyright ©2008, IEEE, Inc. All rights reserved.