Sciweavers

3013 search results - page 231 / 603
» Context-Oriented Domain Analysis
Sort
View
TON
1998
103views more  TON 1998»
15 years 6 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar
SUM
2010
Springer
15 years 5 months ago
Event Modelling and Reasoning with Uncertain Information for Distributed Sensor Networks
CCTV and sensor based surveillance systems are part of our daily lives now in this modern society due to the advances in telecommunications technology and the demand for better sec...
Jianbing Ma, Weiru Liu, Paul Miller
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
TIT
2010
143views Education» more  TIT 2010»
15 years 1 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...
ICDAR
2011
IEEE
14 years 6 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...