Results 1  10
of
436
Geometric AdHoc Routing: Of Theory and Practice
, 2003
"... All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of adhoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient ..."
Abstract

Cited by 317 (13 self)
 Add to MetaCart
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of adhoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient
Hamming Approximation of NP Witnesses
, 2013
"... Given a satisfiable 3SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomialtime verifier for any NPcomplete language. A d(n)Hammingapproximation algorithm for the verifier is o ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
is one that, given any member x of the language, outputs in polynomial time a string a with Hamming distance at most d(n) to some witness w, where (x,w) is accepted by the verifier. Previous results have shown that, if P=NP, every NPcomplete language has a verifier for which there is no (n/2 − n 2/3+δ
The PCP theorem by gap amplification
 In Proceedings of the ThirtyEighth Annual ACM Symposium on Theory of Computing
, 2006
"... The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The celebrated equivalence of this theorem and inapproximability of certain optimization problems, due to [12], has placed the PC ..."
Abstract

Cited by 166 (8 self)
 Add to MetaCart
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The celebrated equivalence of this theorem and inapproximability of certain optimization problems, due to [12], has placed
Manifold reconstruction in arbitrary dimensions using witness complexes
 In Proc. 23rd ACM Sympos. on Comput. Geom
, 2007
"... It is a wellestablished fact that the witness complex is closely related to the restricted Delaunay triangulation in low dimensions. Specifically, it has been proved that the witness complex coincides with the restricted Delaunay triangulation on curves, and is still a subset of it on surfaces, und ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
It is a wellestablished fact that the witness complex is closely related to the restricted Delaunay triangulation in low dimensions. Specifically, it has been proved that the witness complex coincides with the restricted Delaunay triangulation on curves, and is still a subset of it on surfaces
Complements Witness Consistency (Short Paper)
"... Abstract Much of the existing bx literature, especially that from the PL community on lenses, has described extensional, statebased formalisms. More recently, attention has turned to incorporating intensional information about edits (typically based on monoid actions), or more generally, deltas (t ..."
Abstract
 Add to MetaCart
(typically based on categories), describing how models are updated. Pervasive in both the conceptual modelling, and the mathematics, of varieties of such bx, is the role played by the complement, which generalises the 'constant complement' case of the viewupdate problem in databases. Complements
Bitparallel Witnesses and their Applications to Approximate String Matching
 Algorithmica
, 2005
"... We present a new bitparallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k differences in O(⌈m/w⌉n) time, where w is the width ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
on the concept of a witness, which permits sampling some dynamic programming matrix values so as to bound, deduce, or compute others fast. The resulting algorithm is averageoptimal for m ≤ w, assuming the alphabet size is constant. In practice, it performs better than the original ABNDM
A primer on Seshadri constants
, 2008
"... Seshadri constants express the so called local positivity of a line bundle on a projective variety. They were introduced in [Dem92] by Demailly. The original idea of using them towards a proof of the Fujita conjecture was not fulfilled up to now but they quickly became a subject of intensive study q ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
quite in their own right. Lazarsfeld’s book [PAG] contains a whole chapter devoted to local positivity and serves as a very enjoyable introduction to Seshadri constants. Since this book has appeared, the subject witnessed quite a bit of development. It is the aim of these notes to give an account
On the (Im)Possibility of ArthurMerlin Witness Hiding Protocols
"... Abstract. The concept of witnesshiding suggested by Feige and Shamir is a natural relaxation of zeroknowledge. In this paper we identify languages and distributions for which many known constantround publiccoin protocols with negligible soundness cannot be shown to witnesshiding using blackbox t ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract. The concept of witnesshiding suggested by Feige and Shamir is a natural relaxation of zeroknowledge. In this paper we identify languages and distributions for which many known constantround publiccoin protocols with negligible soundness cannot be shown to witnesshiding using black
Searching Paths of Constant Bandwidth
"... Abstract. As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NPcomplete and fixedparameter tractable (FPT) in the parameter k, like this is known for the ..."
Abstract
 Add to MetaCart
Abstract. As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NPcomplete and fixedparameter tractable (FPT) in the parameter k, like this is known
Counterexamples to Witness Conjectures Joris van der Hoeven
"... Consider the class of explog constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an explog constant and let n be its size as an expression. Witness conjectures attempt to give bounds $(n) for the number of decimal digits which n ..."
Abstract
 Add to MetaCart
Consider the class of explog constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an explog constant and let n be its size as an expression. Witness conjectures attempt to give bounds $(n) for the number of decimal digits which
Results 1  10
of
436