Sciweavers

250 search results - page 7 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
VC
2008
102views more  VC 2008»
13 years 10 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
IVC
2000
179views more  IVC 2000»
13 years 10 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 11 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
VMCAI
2004
Springer
14 years 4 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
MM
2003
ACM
143views Multimedia» more  MM 2003»
14 years 4 months ago
Approximate matching algorithms for music information retrieval using vocal input
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
Richard L. Kline, Ephraim P. Glinert