Sciweavers

206 search results - page 31 / 42
» A branch-and-bound algorithm for hard multiple knapsack prob...
Sort
View
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
164
Voted
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
15 years 9 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
MOBIHOC
2002
ACM
15 years 9 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
PAMI
2007
133views more  PAMI 2007»
14 years 9 months ago
Generating Cancelable Fingerprint Templates
—Biometrics-based authentication systems offer obvious usability advantages over traditional password and token-based authentication schemes. However, biometrics raises several p...
Nalini K. Ratha, Sharat Chikkerur, Jonathan H. Con...
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
15 years 6 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz