Sciweavers

10997 search results - page 180 / 2200
» On the Structure of Complete Sets
Sort
View
MICRO
1994
IEEE
99views Hardware» more  MICRO 1994»
15 years 10 months ago
Data relocation and prefetching for programs with large data sets
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
Yoji Yamada, John Gyllenhall, Grant Haab, Wen-mei ...
CVPR
2012
IEEE
13 years 9 months ago
From Pictorial Structures to deformable structures
Pictorial Structures (PS) define a probabilistic model of 2D articulated objects in images. Typical PS models assume an object can be represented by a set of rigid parts connecte...
Silvia Zuffi, Oren Freifeld, Michael J. Black
ICSEA
2008
IEEE
16 years 1 months ago
A UML Based Methodology to Ease the Modeling of a Set of Related Systems
Despite progress in model engineering, modeling large distributed systems is still a long and complex task. This paper outlines a methodology based on UML to make the modeling of ...
Firas Alhalabi, Mathieu Maranzana, Jean-Louis Sour...
ACISP
2005
Springer
16 years 5 days ago
Dynamic Group Key Agreement in Tree-Based Setting
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We p...
Ratna Dutta, Rana Barua
ICDM
2003
IEEE
138views Data Mining» more  ICDM 2003»
15 years 12 months ago
PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
Daniel A. Keim, Christian Panse, Mike Sips, Stephe...