Sciweavers

10493 search results - page 208 / 2099
» Dynamic Word Problems
Sort
View
FC
2005
Springer
133views Cryptology» more  FC 2005»
14 years 1 months ago
RFID Traceability: A Multilayer Problem
Abstract. RFID tags have very promising applications in many domains (retail, rental, surveillance, medicine to name a few). Unfortunately the use of these tags can have serious im...
Gildas Avoine, Philippe Oechslin
COMPGEOM
1996
ACM
14 years 12 days ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
Jeff Erickson
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 10 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
COMPUTING
2006
126views more  COMPUTING 2006»
13 years 8 months ago
Algebraic Multigrid Based on Computational Molecules, 1: Scalar Elliptic Problems
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into the sum of edge matrices thereby assumi...
J. K. Kraus, Josef Schicho
SIAMSC
2008
165views more  SIAMSC 2008»
13 years 8 months ago
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
Kristian Bredies, Dirk A. Lorenz