Sciweavers

2186 search results - page 183 / 438
» Considering an Organization's Memory
Sort
View
SEMWEB
2009
Springer
16 years 1 months ago
Anchor-Flood: Results for OAEI 2009
Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It ...
Md. Seddiqui Hanif, Masaki Aono
SPIN
2007
Springer
16 years 22 days ago
Tutorial: Parallel Model Checking
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
Lubos Brim, Jiri Barnat
SPAA
1997
ACM
15 years 10 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
IEEESP
2006
130views more  IEEESP 2006»
15 years 6 months ago
Securing Embedded Systems
t a single security abstraction layer, but rather is a roblem spanning multiple abstraction levels. We use an embedded biometric authentication device to demonstratethenecessityofa...
David Hwang, Patrick Schaumont, Kris Tiri, Ingrid ...
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
15 years 6 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...