Sciweavers

10054 search results - page 390 / 2011
» On the Complexity of Function Learning
Sort
View
LISP
2008
96views more  LISP 2008»
15 years 4 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
ENTCS
2007
101views more  ENTCS 2007»
15 years 4 months ago
A Framework for Timed Concurrent Constraint Programming with External Functions
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
María Alpuente, Bernhard Gramlich, Alicia V...
JSCIC
2007
89views more  JSCIC 2007»
15 years 4 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa
ISBI
2011
IEEE
14 years 8 months ago
Exact integration of diffusion orientation distribution functions for graph-based diffusion MRI analysis
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
Brian G. Booth, Ghassan Hamarneh
ASUNAM
2011
IEEE
14 years 4 months ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...