Sciweavers

577 search results - page 101 / 116
» Computing Rational Bisectors
Sort
View
JACM
2000
119views more  JACM 2000»
15 years 3 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
JUCS
2002
119views more  JUCS 2002»
15 years 2 months ago
Error-Correction, and Finite-Delay Decodability
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
Stavros Konstantinidis
FUIN
2010
97views more  FUIN 2010»
15 years 1 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant
IEEESP
2010
99views more  IEEESP 2010»
15 years 1 months ago
The Iterated Weakest Link
Abstract. We devise a model for security investment that reflects dynamic interaction between a defender, who faces uncertainty, and an attacker, who repeatedly targets the weakes...
Rainer Böhme, Tyler Moore
SIAMREV
2011
63views more  SIAMREV 2011»
14 years 6 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