Sciweavers

667 search results - page 69 / 134
» Exceptions for Algorithmic Skeletons
Sort
View
PEPM
1994
ACM
14 years 25 days ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
14 years 25 days ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
14 years 13 days ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
PEWASUN
2008
ACM
13 years 10 months ago
The impact of delayed topology information in proactive routing protocols for MANETS
In the design of many proactive routing protocols for MANETs, it is often assumed that topology information is disseminated instantly and error free. Exceptions include hazysighte...
Andres Medina, Stephan Bohacek
NAACL
1994
13 years 10 months ago
Signal Processing for Robust Speech Recognition
This paper describes several new cepstral-based compensation procedures that render the SPHINX-II system more robust with respect to acoustical environment. The first algorithm, p...
Fu-Hua Liu, Pedro J. Moreno, Richard M. Stem, Alej...