A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design
[article]
2016
arXiv
pre-print
Preserved Fulltext
We propose an algorithm with expected complexity of (n n) arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where n is the dimension of the channel ...
vector. ...
CONCLUSIONS In this paper, we proposed an algorithm with the expected complexity of O(n log n) for a shortest vector problem arising in compute-and-forward network coding design. ...
arXiv:1602.00169v1
fatcat:sorwywrju5c3bcgiqms4fxxipy
Cloud-Assisted Remote Sensor Network Virtualization for Distributed Consensus Estimation
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The algorithm converges in linearithmic time for large-scale networks, and requires exchanging a number of messages that is at most linear in the number of sensors. ...
We first propose a distributed sensor network virtualization algorithm that searches for, selects, and coordinates Internet-accessible sensors to perform a sensing task in a specific region. ...
The total time growth is linearithmic in n when Υ is sent to exactly one sensor and when G is connected. ...
arXiv:1501.03547v1
fatcat:srplznimvbh5vehzfddmri7i74
Scheduling of Synchronous Dataflow Graphs with Partially Periodic Real-Time Constraints
2020
Proceedings of the 28th International Conference on Real-Time Networks and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A critical challenge for any real-time CPS software is its scheduling on an embedded computing platform. ...
Our contributions are a few necessary conditions on any live SDF graph, and a linearithmic offline non-preemptive scheduling algorithm on vertices of any directed acyclic task graph. ...
Castrillon for his kind answers to our questions about the MAPS tool. ...
doi:10.1145/3394810.3394820
dblp:conf/rtns/HonoratDBN20
fatcat:gzmge76ccffxbnpfiunlfk32hu
An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganized 2D Points
2013
Computer graphics forum (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Computing B min exactly is an NP-hard problem, whereas Bout is computed in linearithmic time. ...
BC min and B min can be expressed similarly by parametrising a topological constraint. A close approximation of BC min , termed BC 0 can be computed fast using a greedy algorithm. ...
Acknowledgements This research was supported by Discovery Grants program of NSERC, Canada, Grand NCE and ENCS Faculty at Concordia. ...
doi:10.1111/cgf.12162
fatcat:ksrg7v473jf25hffjz5ph3z4em
Efficient algorithms for boundary extraction of 2D and 3D orthogonal pseudomanifolds
2012
Graphical Models
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
All proposed algorithms run in Oðn log nÞ time and use OðnÞ space, where n is the number of vertices of the input. ...
In the 2D case, the input is the set of vertices, and in the 3D case, some small additional information must be supplied for every vertex. ...
Acknowledgments This work has been partially supported by the projects TIN2008-02903 and TIN2011-24220 of the Spanish government and by the IBEC (Bioengineering Institute of Catalonia). ...
doi:10.1016/j.gmod.2012.03.004
fatcat:iqdwnxyb6nerbn4p6a4w3mo2ia
Development and validation of a computationally efficient hybrid model for temporal high-resolution simulations of geothermal bore fields
2022
International journal for numerical and analytical methods in geomechanics (2022). doi:10.1002/nag.3427
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The method achieves computational times reductions of over 90% in some cases, with greater improvement as the simulation time increases. ...
This paper presents a hybrid simulation approach for 1U-, 2U-and coaxial single, and field of, borehole heat exchangers. ...
the shortest dimensionless time, whereas the ILS is only accurate for the medium term and the FLS for the longer term. ...
doi:10.18154/rwth-2022-07551
fatcat:53cdgqse3fhutj7vvxvhjiflkq
Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
While learning generic functions in high dimensions is a cursed estimation problem, most tasks of interest are not generic, and come with essential pre-defined regularities arising from the underlying ...
Indeed, many high-dimensional learning tasks previously thought to be beyond reach -- such as computer vision, playing Go, or protein folding -- are in fact feasible with appropriate computational scale ...
Acknowledgements This text represents a humble attempt to summarise and synthesise decades of existing knowledge in deep learning architectures, through the geometric lens of invariance and symmetry. ...
arXiv:2104.13478v2
fatcat:odbzfsau6bbwbhulc233cfsrom
Caching and Distributed Storage:Models, Limits and Designs
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Last but not the least, I would like to thank my parents, my brother and my sisters and my finacée, Lixia, for their unconditional love and spiritual support at all times. v ...
Limited bandwidth available for transmission plays a central role in this predicament. ...
His patience and impressive vast of knowledge have been the pillars on which this thesis was built. I am forever in debt for his dedication and enthusiasm throughout my time at LINX. ...
doi:10.5075/epfl-thesis-8501
fatcat:gtt5z2b225haxewcgia6wqoojy
Optimization of Markov Random Fields in Computer Vision
[article]
2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Consequently, our algorithm makes it possible to optimally solve multi-label submodular problems involving large numbers of variables and labels on a standard computer. ...
In this thesis, we present new algorithms to perform inference in MRFs, that are either more efficient (in terms of running time and/or memory usage) or more effective (in terms of solution quality), than ...
To compute this subgradient, the state-of-the-art algorithm proposed in [Desmaison et al., 2016a] has a time complexity linearithmic in the number of pixels. ...
doi:10.25911/5d6c3fc2c15c9
fatcat:nbhkpu7jfrb2bpvuxof6jetm7y
Automatic, Run-time and Dynamic Adaptation of Distributed Applications Executing in Virtual Environments
2006
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Automatic, Run-time and Dynamic Adaptation of Distributed Applications Executing in Virtual Environments Ananth Inamti Sundararaj In the last decade we have seen tremendous increases in computer and network ...
This dissertation argues that automatic, run-time and dynamic adaptation in these environments is the key to addressing issues in traditional distributed computing. ...
Intel Corporation is currently designing such a system [16, 90] . ...
doi:10.21985/n2199b
fatcat:qag34hi3f5e4hj6mhcmyv3ycxq
Physical Interaction of Autonomous Robots in Complex Environments
[article]
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A depth image pixel can be modeled as 3D vector of the form: In this work we focus on the problem of object pose estimation for robotic grasping, and in particular we are interested in the Amazon Picking ...
Both the reference joints velocity computation block and the repulsive vector force generation one have a sampling time of 25ms. ...
/* Local variable to access the d_randGen array in a coalesced fashion */ 2 s_randIdx=0; /* Compute the arrays' indices to fullfil the coalescent access requirement */ 3 idx_tx = tIdx + tx_*NPART; 4 idx_ty ...
doi:10.6092/polito/porto/2714147
fatcat:eq4vjofbvzecbkp73ypoco5a7q
Multi-objective virtual machine management in Cloud data centers
2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The problem of high resource wastage and energy consumption is dealt with an online consolidated VM cluster placement scheme, utilizing the Ant Colony Optimization (ACO) metaheuristic and a vector algebra-based ...
As a consequence, efficient utilization of data center resources and minimization of energy consumption are emerging as critical factors for the success of Cloud Computing. ...
ACO-and Vector algebra-based VM Placement (AVVMP) algorithm as a solution to the proposed MCVPP problem. 4. ...
doi:10.4225/03/58b911cef2af4
fatcat:so5knin7q5gbphxkddylifbm2u
DIFFUSIVE PROCESSES ON SOCIAL GRAPHS
[article]
2012
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Nowadays a typical social network have tens to hundreds millions of nodes and billions of arcs, so any algorithm that is more than linear (or linearithmic) in the number of arcs is out of question. ...
In this thesis we present several results that, far from solving these problems, try to push a little forward our understanding of the very structure of social networks. ...
loss in computation time. ...
doi:10.13130/rosa-marco_phd2012-03-06
fatcat:gehvqbbpozgpfdanx76ehzso7y
Preference Learning for Machine Translation
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this work we present and evaluate methods for three distinct scenarios: a) We develop algorithms that can learn from very large amounts of data by exploiting pairwise preferences deőned over competing ...
groups of users in a computer-aided translation scenario; c) We develop methods for two machine translation paradigms, neural-and traditional statistical machine translation, to directly adapt to user-deőned ...
Acknowledgments "The difference between the right word and the almost right word is the difference between lightning and a lightning bug. ž ...
doi:10.11588/heidok.00025488
fatcat:mvnd4rzwcfgr3fef2e6gaqupqa
Hubness in the protein sequence universe
2020
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In addition, deep networks are used to learn protein sequence vector representations, and investigated for orthologous group inference. ...
In the future improved protein representations could eventually allow for accurate sublinear time sequence similarity search, which would alleviate the computational bottleneck of search in ever-growing ...
ACKNOWLEDGMENT We thank Jan Schlüter for fruitful discussions, and Thomas Rattei for computational resources.
Acknowledgements We thank Silvan David Peter for testing the software. ...
doi:10.25365/thesis.64427
fatcat:wbai3saw7nbwtjtywtr73bbky4
« Previous
Showing results 1 — 15 out of 19 results