Sciweavers

1631 search results - page 15 / 327
» Observing Functional Logic Computations
Sort
View
ENTCS
2002
92views more  ENTCS 2002»
13 years 9 months ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...
CADE
2008
Springer
13 years 11 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
SIGCOMM
2000
ACM
14 years 1 months ago
Trajectory sampling for direct traffic observation
Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spati...
Nick G. Duffield, Matthias Grossglauser
ICFP
2007
ACM
14 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
CVPR
2008
IEEE
14 years 12 months ago
Context and observation driven latent variable model for human pose estimation
Current approaches to pose estimation and tracking can be classified into two categories: generative and discriminative. While generative approaches can accurately determine human...
Abhinav Gupta, Trista Chen, Francine Chen, Don Kim...