نتایج جستجو برای: piazza san marco of venice

تعداد نتایج: 21181838  

2012
L. Fregonese M. Scaioni L. Taffurelli

In architectural and cultural heritage documentation, laser scanning technology today offers several opportunities to approach the object to study and to extract manifold information levels from it. These account for point-clouds, 3-D models, and other data about the state of conservation. Georeferenced point-clouds can be adopted as the spatial framework of a Space Information System for Archi...

2014
Mahmudur Rahman Bogdan Carbunar Jaime Ballesteros George Burri Duen Horng Chau

The popularity and influence of reviews, make sites like Yelp ideal targets for malicious behaviors. We present Marco, a novel system that exploits the unique combination of social, spatial and temporal signals gleaned from Yelp, to detect venues whose ratings are impacted by fraudulent reviews. Marco increases the cost and complexity of attacks, by imposing a tradeoff on fraudsters, between th...

Journal: :Nexus Network Journal 2023

Abstract This paper proposes a graph-based mathematical approach with novel metric, the Structure Evolution Degree, to quantitatively analyze urban spatial structure transitions at cross scale and verifies its effectiveness through two cases studies, San Bartolomeo Quarter of Venice Xiaoxihu Historical Block Nanjing.

Journal: :Iowa Journal of Literary Studies 1983

Journal: :Physical review. A, Atomic, molecular, and optical physics 1996
Bonci Grigolini Laux Roncaglia

Luca Bonci, Paolo Grigolini, Adam Laux, and Roberto Roncaglia Dipartimento di Fisica dell’Università di Pisa, Piazza Torricelli 2, 56127 Pisa, Italy Istituto di Biofisica del Consiglio Nazionale delle Ricerche, Via San Lorenzo 26, 56127 Pisa, Italy Department of Physics of the University of North Texas, P.O. Box 5368, Denton, Texas 76203 Department of Solid State Physics, Loránd Eötvös Universi...

2016
Simone Biasco Lianhe Li Edmund H. Linfield A. Giles Davies Miriam S. Vitiello

Simone Biasco 1, Lianhe Li 2, Edmund H. Linfield 2, A. Giles Davies 2 and Miriam S. Vitiello 1,* 1 NEST, CNR—Istituto Nanoscienze and Scuola Normale Superiore, Piazza San Silvestro 12, 56127 Pisa, Italy; [email protected] 2 School of Electronic and Electrical Engineering, University of Leeds, Leeds LS2 9JT, UK; [email protected] (L.L.); [email protected] (E.H.L.); [email protected]...

2010
A. Pitanti D. Navarro-Urrios N. Prtljaga N. Daldosso F. Gourbilleau R. Rizk B. Garrido L. Pavesi

nanoparticle samples A. Pitanti, D. Navarro-Urrios, N. Prtljaga, N. Daldosso, F. Gourbilleau, R. Rizk, B. Garrido, and L. Pavesi Department of Physics, Nanoscience Laboratory, University of Trento, via Sommarive 14, Trento 38100, Italy NEST, Scuola Normale Superiore, Istituto di nanoscienze-CNR, Piazza San Silvestro 12, 56127 Pisa, Italy Dept. Electrònica, MIND-IN2UB, Universitat de Barcelona, ...

2014
Alessandro Pitanti Johannes M. Fink Amir H. Safavi-Naeini Chan U. Lei Jeff T. Hill Alessandro Tredicucci Oskar Painter Thomas J. Watson

Alessandro Pitanti,1, 2 Johannes M. Fink,1 Amir H. Safavi-Naeini,1 Chan U. Lei,1 Jeff T. Hill,1 Alessandro Tredicucci,2, 3 and Oskar Painter1, ∗ 1Institute for Quantum Information and Matter and Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, CA 91125, USA 2NEST and Istituto Nanoscienze CNR, Scuola Normale Superiore, Piazza San Silvestro 12, 5...

Journal: :CoRR 2012
Guido Caldarelli Alessandro Chessa Irene Crimaldi Fabio Pammolli

Guido Caldarelli, 2, 3, 4 Alessandro Chessa, 4 Irene Crimaldi, and Fabio Pammolli IMT Institute for Advanced Studies, Piazza San Ponziano 6, 55100 Lucca, Italy Istituto dei Sistemi Complessi, Consiglio Nazionale delle Ricerche, Dip. Fisica Università ”Sapienza”, P.le A. Moro 2, 00185 Rome, Italy London Institute of Mathematical Sciences, 35a South St, Mayfair London W1K 2XF, UK Linkalab, Comple...

2009
Mauro Franceschelli Alessandro Giua Carla Seatzu

In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial st...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید