Sciweavers

7129 search results - page 341 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SAC
2008
ACM
15 years 4 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
15 years 3 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
SACMAT
2006
ACM
15 years 10 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
121
Voted
ICCAD
1997
IEEE
122views Hardware» more  ICCAD 1997»
15 years 9 months ago
Approximate timing analysis of combinational circuits under the XBD0 model
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, R...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna