Sciweavers

3993 search results - page 262 / 799
» Matchmaking for Structured Objects
Sort
View
ENTCS
2006
89views more  ENTCS 2006»
15 years 3 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
IWQOS
2004
Springer
15 years 9 months ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
ICPR
2004
IEEE
16 years 5 months ago
Towards Surface Regularization via Medial Axis Transitions
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...
Frederic F. Leymarie, Benjamin B. Kimia, Peter J. ...
IPTPS
2005
Springer
15 years 9 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang