Sciweavers

1722 search results - page 140 / 345
» On the sample mean of graphs
Sort
View
ICFP
2007
ACM
16 years 6 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
AGTIVE
1999
Springer
15 years 10 months ago
Support for Design Patterns Through Graph Transformation Tools
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
Ansgar Radermacher
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
WMTE
2005
IEEE
15 years 12 months ago
Lifeblog: A New Concept in Mobile Learning?
In this paper we report early findings from a sample of Australian participants using Nokia’s Lifeblog software on mobile phones to record aspects of living and learning in both...
Elizabeth Hartnell-Young, Frank Vetere
CAMAD
2009
IEEE
15 years 11 months ago
Basic Estimation of Markovian Pseudo Long-Range Dependent Processes
—The pseudo self similar processes are quite attractive due to their simplicity but the question we are interested in this paper concerns the basic estimation of such models. How...
Stephan Robert