Institution
Polytechnic University of Catalonia
Education•Barcelona, 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 published on a yearly basis
Papers
More filters
••
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
••
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
••
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
••
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
••
12 Jan 2003TL;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
Name | H-index | Papers | Citations |
---|---|---|---|
Frede Blaabjerg | 147 | 2161 | 112017 |
Carlos M. Duarte | 132 | 1173 | 86672 |
Ian F. Akyildiz | 117 | 612 | 99653 |
Josep M. Guerrero | 110 | 1197 | 60890 |
David S. Wishart | 108 | 523 | 76652 |
O. C. Zienkiewicz | 107 | 455 | 71204 |
Maciej Lewenstein | 104 | 931 | 47362 |
Jordi Rello | 103 | 694 | 35994 |
Anil Kumar | 99 | 2124 | 64825 |
Surendra P. Shah | 99 | 710 | 32832 |
Liang Wang | 98 | 1718 | 45600 |
Aharon Gedanken | 96 | 861 | 38974 |
María Vallet-Regí | 95 | 711 | 41641 |
Bonaventura Clotet | 94 | 784 | 39004 |
Roberto Elosua | 90 | 481 | 54019 |