Sciweavers

3946 search results - page 443 / 790
» The computational complexity of choice sets
Sort
View
CCR
2010
151views more  CCR 2010»
15 years 4 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
266
Voted
COMJ
2010
15 years 4 months ago
JackTrip/SoundWIRE Meets Server Farm
Even though bidirectional, high-quality and low-latency audio systems for network performance are available, the complexity involved in setting up remote sessions needs better too...
Juan Pablo Cáceres, Chris Chafe
147
Voted
IJISEC
2010
114views more  IJISEC 2010»
15 years 4 months ago
A new hardware-assisted PIR with O(n) shuffle cost
Abstract Since the concept of private information retrieval (PIR) was first formalized by Chor et. al, various constructions have been proposed with a common goal of reducing commu...
Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong...
CVPR
2011
IEEE
15 years 3 months ago
2.5D Building Modeling with Topology Control
2.5D building reconstruction aims at creating building models composed of complex roofs and vertical walls. In this paper, we define 2.5D building topology as a set of roof featu...
Qian-Yi Zhou, Ulrich Neumann
COLING
2010
15 years 1 months ago
An Efficient Shift-Reduce Decoding Algorithm for Phrased-Based Machine Translation
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
Yang Feng, Haitao Mi, Yang Liu, Qun Liu