Sciweavers

16257 search results - page 112 / 3252
» D-finiteness: algorithms and applications
Sort
View
IPPS
1997
IEEE
15 years 2 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
OPODIS
2003
14 years 11 months ago
Detecting Locally Stable Predicates Without Modifying Application Messages
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...
Ranganath Atreya, Neeraj Mittal, Vijay K. Garg
ACL
1994
14 years 11 months ago
Decision Lists for Lexical Ambiguity Resolution: Application to Accent Restoration in Spanish and French
This paper presents a statistical decision procedure for lexical ambiguity resolution. The algorithm exploits both local syntactic patterns and more distant collocational evidence...
David Yarowsky
CDC
2010
IEEE
336views Control Systems» more  CDC 2010»
14 years 5 months ago
An application of IMPACT structure to bilateral teleoperations
Abstract-- Time-delays typically cause stability and performance problems in teleoperation systems. As a remedy for such problems in position-error based bilateral teleoperations, ...
Alper Denasi, Dragan Kostic, Henk Nijmeijer
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
13 years 10 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel