Sciweavers

2542 search results - page 152 / 509
» An Operational Definition of Context
Sort
View
158
Voted
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 6 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
CVPR
1996
IEEE
1457views Computer Vision» more  CVPR 1996»
16 years 8 months ago
Edge Detection and Ridge Detection with Automatic Scale Selection
When computing descriptors of image data, the type of information that can be extracted may be strongly dependent on the scales at which the image operators are applied. This arti...
Tony Lindeberg
PODS
1994
ACM
91views Database» more  PODS 1994»
15 years 11 months ago
A Polymorphic Calculus for Views and Object Sharing
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
Atsushi Ohori, Keishi Tajima
CLUSTER
2000
IEEE
15 years 6 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...
IANDC
2006
77views more  IANDC 2006»
15 years 6 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