#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1992

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andor Haznagy, Istvan Fi, András London, Tamás Németh
- 2015 International Conference on Models and…
- 2015

In this study, using the network approach, we analyzed the urban public transportation systems of 5 Hungarian cities. We performed a comprehensive network analysis of the systems with the main goal of identifying significant similarities and differences of the transportation networks of these cities. Although previous studies often investigated unweighted… (More)

- Istvan Fi, O Fo
- 1992

majority algorithm is O(n 2 mD), where D is the size in bits of a data item. Lemma 22 The space complexity of the majority algorithm is O(nD), where D is the size in bits of a data-item. Proof: Each token sent in the majority algorithm consists of O(D) bits. Applying this to Lemma 14, we get the space complexity of O(nD) bits. 2 C The Data Dispersal… (More)

- Istvan Fi, Arpad Barsi, Tamas Lovas, Zoltán Siki, Gergely Fordos
- Proceedings. 2005 IEEE Intelligent Transportation…
- 2005

Due to the heavy traffic, people living in urban areas have to get used to congested roads, increased traveling time, and stressful situations. There is a strong demand on acquiring real-time flow data on actual traffic and road conditions. Our paper presents a method on acquiring several traffic data from different data sources, such as induction loop… (More)

- ‹
- 1
- ›