Sciweavers

4099 search results - page 806 / 820
» First Class Patterns
Sort
View
IANDC
2006
77views more  IANDC 2006»
13 years 7 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
IJON
2006
109views more  IJON 2006»
13 years 7 months ago
Integrating the improved CBP model with kernel SOM
In this paper, we first design a more generalized network model, Improved CBP, based on the same structure as Circular BackPropagation (CBP) proposed by Ridella et al. The novelty ...
Qun Dai, Songcan Chen
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 7 months ago
Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
Richard McClatchey, Ashiq Anjum, Heinz Stockinger,...
JCT
2008
109views more  JCT 2008»
13 years 7 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
JSW
2008
106views more  JSW 2008»
13 years 7 months ago
Hierarchical Image Segmentation by Structural Content
Image quality loss resulting from artifacts depends on the nature and strength of the artifacts as well as the context or background in which they occur. In order to include the im...
Nathir A. Rawashdeh, Shaun T. Love, Kevin D. Donoh...