scispace - formally typeset
Search or ask a question
Institution

Polytechnic University of Catalonia

EducationBarcelona, Spain
About: Polytechnic University of Catalonia is a education organization based out in Barcelona, Spain. It is known for research contribution in the topics: Finite element method & Population. The organization has 16006 authors who have published 45325 publications receiving 949306 citations. The organization is also known as: UPC - BarcelonaTECH & Technical University of Catalonia.


Papers
More filters
Journal ArticleDOI
TL;DR: This letter compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q.
Abstract: In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature.

175 citations

Journal ArticleDOI
TL;DR: In this article, the authors presented the first results of two actions developed during 2009, which confirmed the great capacity of green facades to produce shade, reducing the heat on the facade wall of the building.

175 citations

Journal ArticleDOI
TL;DR: In this paper, a multi-temporal dual channel algorithm (MT-DCA) was proposed to estimate vegetation optical depth and soil moisture from time series of dual-polarized L-band radiometric observations along with time-invariant scattering albedo.

175 citations

Journal ArticleDOI
TL;DR: An ant algorithm is presented that incorporates some ideas that have offered good results with simple balancing problems, and the validity of the proposed algorithms is tested by means of a computational experience with reference instances.

175 citations

Proceedings ArticleDOI
12 Jan 2003
TL;DR: This paper shows how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.
Abstract: Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.

174 citations


Authors

Showing all 16211 results

NameH-indexPapersCitations
Frede Blaabjerg1472161112017
Carlos M. Duarte132117386672
Ian F. Akyildiz11761299653
Josep M. Guerrero110119760890
David S. Wishart10852376652
O. C. Zienkiewicz10745571204
Maciej Lewenstein10493147362
Jordi Rello10369435994
Anil Kumar99212464825
Surendra P. Shah9971032832
Liang Wang98171845600
Aharon Gedanken9686138974
María Vallet-Regí9571141641
Bonaventura Clotet9478439004
Roberto Elosua9048154019
Network Information
Related Institutions (5)
Delft University of Technology
94.4K papers, 2.7M citations

94% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

94% related

University of Waterloo
93.9K papers, 2.9M citations

94% related

Georgia Institute of Technology
119K papers, 4.6M citations

93% related

Technical University of Denmark
66.3K papers, 2.4M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20241
2023129
2022379
20212,313
20202,429
20192,427