Sciweavers

10493 search results - page 1681 / 2099
» Dynamic Word Problems
Sort
View
134
Voted
FOCS
1991
IEEE
15 years 7 months ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
146
Voted
FLAIRS
2008
15 years 6 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon
141
Voted
BPM
2008
Springer
217views Business» more  BPM 2008»
15 years 5 months ago
Detecting Regulatory Compliance for Business Process Models through Semantic Annotations
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
Guido Governatori, Jörg Hoffmann, Shazia Wasi...
155
Voted
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 5 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
138
Voted
EUROCRYPT
2008
Springer
15 years 5 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
« Prev « First page 1681 / 2099 Last » Next »