Sciweavers

4850 search results - page 291 / 970
» Approximate Data Structures with Applications
Sort
View
ISI
2008
Springer
15 years 6 months ago
Data mining for social network analysis
A social network is defined as a social structure of individuals, who are related (directly or indirectly to each other) based on a common relation of interest, e.g. friendship, t...
J. Srivastava
WSE
2003
IEEE
15 years 12 months ago
Considering Browser Interaction in Web Application Testing
As web applications evolves, their structure may become more and more complex. Thus, systematic approaches/methods for web application testing are needed. Existing methods take in...
Giuseppe A. Di Lucca, Massimiliano Di Penta
CRIWG
1997
15 years 8 months ago
CLASS: A Computer Platform for the Development of Education's Collaborative Applications
In spite of the important development that the Web has gone through in the last years, the field of education has not taken fully advantage of this development. Using this technol...
Luis A. Guerrero, David A. Fuller
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
15 years 11 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
PLILP
1994
Springer
15 years 10 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte