Sciweavers

694 search results - page 59 / 139
» The Power of the Middle Bit
Sort
View
AIR
2005
99views more  AIR 2005»
13 years 8 months ago
Evolving General Term-Weighting Schemes for Information Retrieval: Tests on Larger Collections
Term-weighting schemes are vital to the performance of Information Retrieval models that use term frequency characteristics to determine the relevance of a document. The vector spa...
Ronan Cummins, Colm O'Riordan
DAGM
2011
Springer
12 years 7 months ago
Using Landmarks as a Deformation Prior for Hybrid Image Registration
Hybrid registration schemes are a powerful alternative to fully automatic registration algorithms. Current methods for hybrid registration either include the landmark information a...
Marcel Lüthi, Christoph Jud, Thomas Vetter
HOST
2008
IEEE
14 years 2 months ago
Slicing Up a Perfect Hardware Masking Scheme
—Masking is a side-channel countermeasure that randomizes side-channel leakage, such as the power dissipation of a circuit. Masking is only effective on the condition that the in...
Zhimin Chen, Patrick Schaumont
IPPS
2006
IEEE
14 years 2 months ago
Selection of instruction set extensions for an FPGA embedded processor core
A design process is presented for the selection of a set of instruction set extensions for the PowerPC 405 processor that is embedded into the Xilinx Virtex Family of FPGAs. The i...
Brian F. Veale, John K. Antonio, Monte P. Tull, S....
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 7 days ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan