Sciweavers

317 search results - page 7 / 64
» Computing and Updating the Process Number in Trees
Sort
View
EJC
2010
13 years 7 months ago
The shape of unlabeled rooted random trees
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
Michael Drmota, Bernhard Gittenberger
GIS
2010
ACM
13 years 5 months ago
Efficient indexing structure for scalable processing of spatial alarms
Spatial Alarms are reminders for mobile users upon their arrival of certain spatial location of interest. Spatial alarm processing requires meeting two demanding objectives: high ...
Myungcheol Doo, Ling Liu, Nitya Narasimhan, Venu V...
CHES
2007
Springer
111views Cryptology» more  CHES 2007»
14 years 1 months ago
TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks
Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay r...
Reouven Elbaz, David Champagne, Ruby B. Lee, Lione...
ICPR
2008
IEEE
14 years 2 months ago
Endmember detection using the Dirichlet process
An endmember detection algorithm for hyperspectral imagery using the Dirichlet process to determine the number of endmembers in a hyperspectral image is described. This algorithm ...
Alina Zare, Paul D. Gader
IPPS
2009
IEEE
14 years 2 months ago
Resource allocation strategies for constructive in-network stream processing
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...