Sciweavers

5115 search results - page 608 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
16 years 7 days ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
16 years 7 days ago
Masking at Gate Level in the Presence of Glitches
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
Wieland Fischer, Berndt M. Gammel
MIDDLEWARE
2005
Springer
16 years 5 days ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
WIDM
2004
ACM
16 years 3 days ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
IV
2003
IEEE
87views Visualization» more  IV 2003»
15 years 12 months ago
Rendering recognizably unique textures
We present a perceptually designed hardwareaccelerated algorithm for generating unique background textures for distinguishing documents. To be recognizable, the texture should pro...
Janne V. Kujala, Tuomas J. Lukka