Filters








3,743 Hits in 3.4 sec

Graph Reconstruction via Distance Oracles [chapter]

Claire Mathieu, Hang Zhou
2013 Lecture Notes in Computer Science  
For every a ∈ A, reconstruct G [D a ] by querying D a × D a 3 Return a G [D a ] Claire Mathieu and Hang Zhou Graph Reconstruction via Distance Oracles  ...  a 4 a 5 Main Algorithm 1 Construct A of expected sizeÕ( √ n) such that max A |D a | = O( √ n) 2 For every a ∈ A, reconstruct G [D a ] by querying D a × D a 3 Return a G [D a ] Graphs of bounded degree  ... 
doi:10.1007/978-3-642-39206-1_62 fatcat:qvxfr5kw7fbqdllqrymf7tgjsm

Graph Reconstruction via Distance Oracles [article]

Claire Mathieu, Hang Zhou
2013 arXiv   pre-print
We study the problem of reconstructing a hidden graph given access to a distance oracle.  ...  Õ(n); and near-optimal approximate reconstruction of a general graph.  ...  Research supported in part by the French ANR Blanc program under contract ANR-12-BS02-005 (RDAM project). the vertex set V , and we have access to δ via a query oracle Query(·, ·) which, upon receiving  ... 
arXiv:1304.6588v1 fatcat:pwf4ajdyf5el5l374hoddyrv5m

Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs [chapter]

Marc Lelarge, Hang Zhou
2013 Lecture Notes in Computer Science  
Graph Reconstruction via Distance Oracles. Claire Mathieu and Hang Zhou. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2013.  ...  Inference -ICALP conference, Japan, 2015 -University of Copenhagen, Denmark, 2014 Graph Reconstruction via Distance Oracles -ICALP conference, Latvia, 2013 -École Normale Supérieure, France, 2014 Sublinear-Time  ... 
doi:10.1007/978-3-642-45030-3_14 fatcat:cs27muh23fgejlpec7j3pdqmie

Sim-2-Sim Transfer for Vision-and-Language Navigation in Continuous Environments [article]

Jacob Krantz, Stefan Lee
2022 arXiv   pre-print
We fine-tune our reconstruction-trained VLN BERT via imitation learning in VLN-CE.  ...  We run this oracle over SGM candidates and navigate via the Oracle Policy. We find success rates of 89% in Train * , 93% in Val-Seen, and 90% in Val-Unseen (Fig. 3(a) ).  ... 
arXiv:2204.09667v2 fatcat:xdxecjlvn5hefmxz5kekhpcy6i

Local Reconstructors and Tolerant Testers for Connectivity and Diameter [chapter]

Andrea Campagna, Alan Guo, Ronitt Rubinfeld
2013 Lecture Notes in Computer Science  
A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is "close" to having the property, provides oracle access to the adjacency  ...  Along the way, we present a method of transforming a local reconstructor (which acts as a "adjacency matrix oracle" for the corrected graph) into an "adjacency list oracle".  ...  to change one graph to the other, then their distance is k/m.  ... 
doi:10.1007/978-3-642-40328-6_29 fatcat:sw7xhprozbchfjmxsbeonjzsq4

Local reconstructors and tolerant testers for connectivity and diameter [article]

Andrea Campagna, Alan Guo, Ronitt Rubinfeld
2013 arXiv   pre-print
A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is "close" to having the property, provides oracle access to the adjacency  ...  Along the way, we present a method of transforming a local reconstructor (which acts as a "adjacency matrix oracle" for the corrected graph) into an "adjacency list oracle".  ...  to change one graph to the other, then their distance is k/m.  ... 
arXiv:1208.2956v2 fatcat:kdwhlqywandqfp3q2ifjrtwjcm

What Do Single-view 3D Reconstruction Networks Learn? [article]

Maxim Tatarchenko, Stephan R. Richter, René Ranftl, Zhuwen Li, Vladlen Koltun, Thomas Brox
2019 arXiv   pre-print
reconstruction but image classification.  ...  Convolutional networks for single-view object reconstruction have shown impressive performance and have become a popular subject of research.  ...  In SIG- GRAPH, 1987. 3 [30] Zhaoliang Lun, Matheus Gadelha, Evangelos Kalogerakis, Subhransu Maji, and Rui Wang. 3D shape reconstruction from sketches via multi-view convolutional networks.  ... 
arXiv:1905.03678v1 fatcat:vb2vv52n5rcvbp26rhfg6yfufe

Construction of Tight Frames on Graphs and Application to Denoising [article]

Franziska Göbel, Gilles Blanchard, Ulrike von Luxburg
2017 arXiv   pre-print
By applying a thresholding method to the coefficients in the reconstruction formula, we define an estimate of f whose risk satisfies a tight oracle inequality.  ...  This means we have a very simple, explicit reconstruction formula for every function f defined on the graph from the coefficients given by its scalar product with the frame elements.  ...  Following usual heuristics, for the construction of the k-NN graph we take k = 7 ≈ log n; for the ε-graph, we take for ε the average distance to the k = 7th nearest neighbor, and for weighted graphs we  ... 
arXiv:1408.4012v2 fatcat:jsc2jc45fnhknf23vbcuqkhizy

Reconstructing Markov processes from independent and anonymous experiments

Silvio Micali, Zeyuan Allen Zhu
2016 Discrete Applied Mathematics  
We prove quite tight bounds for such exact reconstruction in terms of both the number of experiments and their lengths.  ...  We investigate the problem of exactly reconstructing, with high confidence and up to isomorphism, the ball of radius r centered at the starting state of a Markov process from independent and anonymous  ...  Mathieu and Zhou [24] generalize this lower bound to allow approximate distance oracles, provide an upper bound of  O(n 3/2 ) for constant-degree graphs, and  O(n) for outerplanar graphs.  ... 
doi:10.1016/j.dam.2015.06.035 fatcat:xx5belh6hrd75p5otkjb7nn3uy

Implementation and Visualization of Discrete Computational Geometry Using Database Managers

Stella Orozco Ochoa, Oscar Ruiz Salguero, Carlos Cadavid A.
2019 International Journal of Engineering and Technology  
This manuscript presents the usage of DBMS graph capabilities for approximation of hard core computational geometry algorithms.  ...  Taping into the vast graph capabilities of DBMSs has the obvious advantage of large algorithm libraries, which in this case we apply to computational geometry.  ...  data sets Antelope and (Cow) Vertebra, (b) the Dept. of Informatics of University of Vigo -Spain, which hosted part of this manuscript's work by author Stella Orozco -Ochoa and offered her the inspiring graph  ... 
doi:10.21817/ijet/2019/v11i3/191103101 fatcat:rdfuz2rfgva6deyw3b56c7k2zu

Low-Dimensional Embedding with Extra Information

Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Piotr Indyk
2006 Discrete & Computational Geometry  
., distances, angles, and/or orientations), and the goal is to reconstruct the global geometry from this partial information.  ...  For general graphs, the analogous problem is NP-hard even with exact distances.  ...  A reconstruction is always unique (up to isometry) and easy to compute for a complete graph of exact distances, or any graph that can be "shelled" by incrementally locating nodes according to the distances  ... 
doi:10.1007/s00454-006-1268-5 fatcat:7lr2eqtxzzdzdop6dzhzyicpsy

Object Extraction from Bounding Box Prior with Double Sparse Reconstruction

Lingzheng Dai, Jundi Ding, Jian Yang, Fanlong Zhang, Junxia Li
2015 2015 IEEE International Conference on Computer Vision Workshop (ICCVW)  
The idea is that object regions should be with small reconstruction errors to segment hypotheses bases, simultaneously, they should have large reconstruction errors to background hypotheses bases.  ...  With them, we formulate the object extraction as a "double" sparse reconstruction problem in terms of the bounding box results.  ...  The ℓ 2 norm is used to minimizing the distance between the prediction reconstruction and each super-pixel.  ... 
doi:10.1109/iccvw.2015.120 dblp:conf/iccvw/DaiDYZL15 fatcat:wbi7utymlzeljkhzukwhreizmy

Distance Oracles for Time-Dependent Networks [article]

Spyros Kontogiannis, Christos Zaroliagis
2015 arXiv   pre-print
We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by continuous, piecewise linear, positive functions possessing the FIFO property  ...  Our oracle is based only on the sparsity of the network, along with two quite natural assumptions about travel-time functions which allow the smooth transition towards asymmetric and time-dependent distance  ...  Towards a time-dependent distance oracle Our approach for providing a time-dependent distance oracle is inspired by the generic approach for general undirected graphs under static travel-time metrics.  ... 
arXiv:1309.4973v3 fatcat:heo247oqxnbirhjil64ir6j7zq

Near-Linear Query Complexity for Graph Inference [chapter]

Sampath Kannan, Claire Mathieu, Hang Zhou
2015 Lecture Notes in Computer Science  
When there is no a priori mental image and the goal is to reconstruct an unknown graph with few distance queries, we give anÕ(n) randomized algorithm for chordal graphs of bounded degree.  ...  their shortest path distance in G?  ...  In the graph reconstruction problem, we are given the vertex set V , and we have access to δ via a query oracle Query(·, ·) which, upon receiving a query (u, v) ∈ V 2 , returns δ(u, v).  ... 
doi:10.1007/978-3-662-47672-7_63 fatcat:m5x7e6734jfizn45oviiqhs5za

Inference of functional connectivity in Neurosciences via Hawkes processes

Patricia Reynaud-Bouret, Vincent Rivoirard, Christine Tuleau-Malot
2013 2013 IEEE Global Conference on Signal and Information Processing  
A new Lasso method designed for general multivariate counting processes [1] enables us to estimate the functional connectivity graph between the different recorded neurons.  ...  ACKNOWLEDGEMENT This research is partly supported by the french ANR Calibration and the PEPS BMI Estimation of dependence graphs for thalamo-cortical neurons and multivariate Hawkes processes.  ...  This oracle inequality is stated by using a distance between predictable processes expressed via .  ... 
doi:10.1109/globalsip.2013.6736879 dblp:conf/globalsip/Reynaud-BouretRT13 fatcat:cfxxiunlz5htzn7b7dglazqs24
« Previous Showing results 1 — 15 out of 3,743 results