Filters








38,026 Hits in 6.3 sec

Neuro-Hotnet: A Graph Theoretic Approach for Brain FC Estimation [article]

Nathan Tung, Eli Upfal, Jerome Sanes, Ani Eloyan
2022 arXiv   pre-print
To verify our approach, we analyze task-based fMRI data obtained from the Human Connectome Project database, which reveal novel insights into brain interactions during performance of a motor task.  ...  Our proposed algorithm leverages a graphical random walk on DTI data to define a new measure of structural influence that highlights connected components of interest.  ...  Neuro-Hotnet We propose a modeling approach for task FC following a graph theoretic framework.  ... 
arXiv:2111.08118v3 fatcat:yiksw6l3b5dgjgukx5i7zpenbu

Self-adjusting computation

Umut A. Acar
2008 Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation - PEPM '09  
For example, a self-adjusting program can compute a property of a dynamically changing set of objects, or a set of moving objects, etc.  ...  This thesis investigates a model of computation, called self-adjusting computation, where computations adjust to any external change to their data (state) automatically.  ...  The algorithm relies on the ListCombine structure for finding the leftmost and the rightmost points, as well as the point farthest away from a line.  ... 
doi:10.1145/1480945.1480946 dblp:conf/pepm/Acar09 fatcat:dkt7ohj7zffjhgojqgn3pl4lwq

Self-adjusting computation

R. Harper
2004 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.  
For example, a self-adjusting program can compute a property of a dynamically changing set of objects, or a set of moving objects, etc.  ...  This thesis investigates a model of computation, called self-adjusting computation, where computations adjust to any external change to their data (state) automatically.  ...  The algorithm relies on the ListCombine structure for finding the leftmost and the rightmost points, as well as the point farthest away from a line.  ... 
doi:10.1109/lics.2004.1319619 dblp:conf/lics/Harper04 fatcat:vvjwu4dq6nd7hpqgfhpk63pjrq

Self-Adjusting Computation [chapter]

Robert Harper
2004 Lecture Notes in Computer Science  
For example, a self-adjusting program can compute a property of a dynamically changing set of objects, or a set of moving objects, etc.  ...  This thesis investigates a model of computation, called self-adjusting computation, where computations adjust to any external change to their data (state) automatically.  ...  The algorithm relies on the ListCombine structure for finding the leftmost and the rightmost points, as well as the point farthest away from a line.  ... 
doi:10.1007/978-3-540-27836-8_1 fatcat:6tqe22fqhbejvna265jg7mddwa

Good Graph to Optimize: Cost-Effective, Budget-Aware Bundle Adjustment in Visual SLAM [article]

Yipu Zhao, Justin S. Smith, Patricio A. Vela
2020 arXiv   pre-print
Results from the second scenario, indicate that Good Graph benefits the trajectory tracking performance of VSLAM-based closed-loop navigation systems, which is a primary application of VSLAM.  ...  To better suit BA-based VSLAM back-ends, the Good Graph predicts future estimation needs, dynamically assigns an appropriate size budget, and selects a condition-maximized subgraph for BA estimation.  ...  Last, literature related to submodular submatrix selection, which serves as the theoretical basis behind Good Graph, is covered. A.  ... 
arXiv:2008.10123v1 fatcat:dlilgtwbw5b77jmfa4ppczjsam

Implicit self-adjusting computation for purely functional programs

Yan Chen, Jana Dunfield, Matthew A. Hammer, Umut A. Acar
2011 SIGPLAN notices  
Using the compiler, we are able to incrementalize an interesting set of applications, including standard list and matrix benchmarks, ray tracer, PageRank, sparse graph connectivity, and social circle counts  ...  This dissertation presents implicit self-adjusting computation, a type directed technique for translating purely functional programs into self-adjusting programs.  ...  Here we briefly review the domain-specific approaches to incremental computation. Data dependence graph.  ... 
doi:10.1145/2034574.2034792 fatcat:w2onpvjmbbem7bblqe73ktog5i

An Adjustable-Autonomy Agent for Intelligent Environments

Matthew Ball, Vic Callaghan, Michael Gardner
2010 2010 Sixth International Conference on Intelligent Environments  
We present our Adjustable-autonomy Behaviour-Based Agent (ABBA) architecture model and discuss our initial trials with our prototype system, built on a smart home emulator, which demonstrate the plausibility  ...  This paper reports on the current progress of our project to enable human users and agents to collaborate in managing intelligent environments as a team.  ...  It is inspired by the incremental synchronous learning (ISL) agent developed by Hagras et al. [12] .  ... 
doi:10.1109/ie.2010.8 dblp:conf/intenv/BallCG10 fatcat:ymmidhwof5aj3bi3mlbxksblme

A Library for Self-Adjusting Computation

Umut Acar, Guy Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan
2006 Electronical Notes in Theoretical Computer Science  
The interface for memoization, however, does not scale well, suggesting a language-based approach to be preferable after all.  ...  The problem of processing a small change to the input of a program efficiently has been studied extensively in the programming-languages community. This is known as incremental computation.  ...  As a self-adjusting program executes, the run-time system builds a dynamic dependence graph (or DDG)) that represents the relationship between computation and data.  ... 
doi:10.1016/j.entcs.2005.11.043 fatcat:tb2jvoy55nganhv7iu4w6tgr4q

Distributionally adjusted life expectancy as a life table function

Francisco Goerlich
2020 Demographic Research  
Final comments This paper has theoretically derived a distributionally adjusted life expectancy index that summarizes in a single number the life expectancy and the inequality in length of life distribution  ...  We follow an axiomatic approach similar to Shorrocks (2009b) in developing a life expectancy index adjusted for distributional considerations, taking into account that Shorrocks (2009b) deals with  ...  Then, the number of survivors, l x (of the initial 100,000), at age x is  (;) Uz   is concave as a function of z for 1  and strictly concave for 1  (Magnus and Neudecker 1988, chapter 11,  ... 
doi:10.4054/demres.2020.43.14 fatcat:7h3ap2vkcfcxdlzf6zgz4eneyu

Bundle Adjustment — A Modern Synthesis [chapter]

Bill Triggs, Philip F. McLauchlan, Richard I. Hartley, Andrew W. Fitzgibbon
2000 Lecture Notes in Computer Science  
Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates.  ...  This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community.  ...  Elimination graph: A graph derived from the network graph, describing the progress of fill in during sparse matrix factorization.  ... 
doi:10.1007/3-540-44480-7_21 fatcat:jm2ewshh5bejhnv5dixghvp6y4

Right-Turn Traffic Volume Adjustment in Traffic Signal Warrant Analysis

Cui Zhou, Zong Tian
2016 Transportation Research Record  
Previous right-turn volume reduction methods based mostly on engineering judgment lack specific theoretical backgrounds. Therefore, this paper proposes a new method with theoretical justification.  ...  An intersection with heavy right-turn volumes, without any reduction, might mislead a signal warrant analysis, and a different conclusion may be reached on whether a signal is warranted.  ...  increment.  ... 
doi:10.3141/2562-04 fatcat:rl5boqndyrbi3duwsyxp62l7dm

Strategy for an Autonomous Behavior that Guarantees a Qualitative Fine Adjustment at the Target Pose of a Collaborating Mobile Robot

Kai Waelti
2021 Zenodo  
This thesis introduces a strategy that leverages a pose graph-based localization approach to reduce positioning errors at target poses of collaborating mobile robots.  ...  Finally, we evaluate the proposed method in a industrial setting achieving a position error below 25 mm in 92.7% and a rotation error below 1.5° in 93.9% of the tests.  ...  While the approach using a Gaussian adjustment does not lead to a perfect social navigation it is certainly a better solution than having no costmap modifications at all.  ... 
doi:10.5281/zenodo.4742013 fatcat:637baqamlffkfda5cvvxzegyuy

Jump Testing and the Speed of Market Adjustment

Torben Beedholm Rasmussen
2009 Social Science Research Network  
To capture these microstructure e ects, this paper suggests a model in which market prices adjust gradually to jumps in the underlying e cient price.  ...  Evidence indicates that tests based on the largest of scaled price increments perform better than tests comparing measures of variability.  ...  Note: Example of a path for the noise term in the gradual price adjustment model. The graph shows how much the observed price, Y t , deviates from the underlying price Y t , following a jump in Y t .  ... 
doi:10.2139/ssrn.1351703 fatcat:py7kznnsovc2bg4noq3xvg2deu

Price Adjustment and Market Structure

Simon Domberger
1979 Economic Journal  
is a complex question which is open to more than one analytical approach.  ...  In the theoretical section, two distinct aspects of the price adjustment decision are examined.  ... 
doi:10.2307/2231409 fatcat:6meh5iartfcufcsv5yg6kwzw74

MODERN METHODS OF BUNDLE ADJUSTMENT ON THE GPU

R. Hänsch, I. Drude, O. Hellwich
2016 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
Based on an initial estimate provided by structure from motion, bundle adjustment seeks to find a solution that is optimal for all cameras and 3D points.  ...  While many adaptations and extensions to the classical bundle adjustment approach have been proposed, only few works consider the acceleration potentials of GPU systems.  ...  The reconstruction was carried out by an incremental SfM pipeline , which automatically defines a skeletal graph representing images that are sufficient to describe the major part of the 3D scene.  ... 
doi:10.5194/isprs-annals-iii-3-43-2016 fatcat:d32dbxb4wneknorgi2mhycvyle
« Previous Showing results 1 — 15 out of 38,026 results