Sciweavers

3227 search results - page 133 / 646
» Designing with Distance Fields
Sort
View
NHM
2010
100views more  NHM 2010»
13 years 5 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
IACR
2011
292views more  IACR 2011»
12 years 10 months ago
Practical Relay Attack on Contactless Transactions by Using NFC Mobile Phones
—Contactless technology is widely used in security sensitive applications, including identification, payment and access-control systems. Near Field Communication (NFC) is a shor...
Lishoy Francis, Gerhard P. Hancke, Keith Mayes, Ko...
BMCBI
2010
135views more  BMCBI 2010»
13 years 11 months ago
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
Suzanne Matthews, Tiffani L. Williams
SEBD
1997
158views Database» more  SEBD 1997»
14 years 2 days ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
ITCC
2005
IEEE
14 years 4 months ago
A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
Alireza Hodjat, David Hwang, Ingrid Verbauwhede