Sciweavers

36 search results - page 4 / 8
» The Universal Resolving Algorithm: Inverse Computation in a ...
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
SIAMREV
2011
63views more  SIAMREV 2011»
12 years 10 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 7 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
ICTAC
2009
Springer
13 years 5 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird