Solid-connection rearrangeability for 3-stage clos networks,in the multirate environment. CTI Technical Report TR 99/12/03

Solid-connection rearrangeability for 3-stage clos networks,in the multirate environment. CTI Technical Report TR 99/12/03

Bibliographic Details
Other Authors:	Λιοτόπουλος, Φώτιος Κ.
Format:	Book
Language:	English
Published:	Patras, Greece CTI 1999
Subjects:	TECHNICAL REPORT CTI TR 1999 ΤΕΧΝΙΚΗ ΑΝΑΦΟΡΑ

Similar Items

Rearrangeably nonblocking operation of 3-stage clos networks,in the multirate environment. CTI Technical Report TR 99/12/02
Published: (1999)

Multirate non-blocking, generalised, 3-stage clos switching networks. CTI Technical Report TR 99/12/01
Published: (1999)

Indexing trajectories of moving point objects. C.T.I. Technical Report TR 99/07/03
by: Pfoser, Dieter, et al.
Published: (1999)

Relation between software metrics and maintainability. C.T.I. Technical Report TR 99/08/03
by: Χριστοδουλάκης, Δημήτριος Νικ, et al.
Published: (1999)

A new algorithm for rectangle enclosure reporting. C.T.I. TR 99/09/03
by: Μακρής, Χρήστος, et al.
Published: (1999)

E-slate V specification (5th development stage). C.T.I. Technical Report TR 99/09/02
by: Κουτλής, Μανόλης, et al.

Neurules: A hybrid approach to knowledge representation. CTI Technical Report TR 99/12/04

Investigating the features of digital libraries. C.T.I. Technical Report TR 99/09/05
by: Αρμενη, Σ., et al.
Published: (1999)

Semantic abstraction in the multimedia domain. C.T.I. Technical Report TR 99/09/06
Published: (1999)

Geometric retrieval in RAM model. C.T.I. Technical Report TR 99/10/05
Published: (1999)

On-line call control in cellular networks. C.T.I. Technical Report TR 99/10/02
by: Καραγιάννης, Ιωάννης, et al.
Published: (1999)

Algorithmic issues in mobile environments with fixed hosts. CTI Technical Report TR 99/11/02
Published: (1999)

Optimal algorithms for reporting visible rectangles. C.T.I. TR 99/09/04
by: Κίτσιος, Ν., et al.
Published: (1999)

Multiple signature embedding using consecutive pixel distribution. CTI Technical Report TR 99/11/01
Published: (1999)

Evaluation of access structures for discretely moving points C.T.I. Technical Report TR 99/07/02
Published: (1999)

Binary string relations: a foundation for spatiotemporal knowledge resresentation. CTI Technical Report TR 99/02/01
Published: (1999)

Constraint-based processing of multi-way spatial joins. C.T.I. Technical Report TR 99/10/01
by: Παπαδιάς, Δημήτρης, et al.
Published: (1999)

The LS-Quintary tree. A universal multidimmensional data structure with linear space (Extended Abstract). CTI Technical Report 99/06/03
Published: (1999)

Efficient cost models for spatial queries using R-trees. C.T.I. Technical Report TR 99/07/04
by: Θεοδωρίδης, Γιάννης, et al.
Published: (1999)

Low power BIST for Wallace-Tree based fast multipliers. C.T.I. Technical Report TR 99/09/07
Published: (1999)

A fractal-based method to improve lossless image compression schemes. CTI Technical Report TR99/10/06
Published: (1999)

Evaluation and testing of a fractal-based method for lossless image compression. CTI Technical Report TR 99/10/07
Published: (1999)

A provably efficient computational model for approximate spatiotemporal retrieval. C.T.I. TR 99/05/02
by: Σιουτας, Σπυρος

Fast parallel weighted random sampling. CTI Technical Report 99/06/02
Published: (1999)

The temporal precedence problem in linear space and O(1) worst case update time. C.T.I. Technical Report TR 99/10/04
by: Μακρής, Χρήστος, et al.
Published: (1999)

Lessons learned on measuring perceived software quality. CTI Technical Report 99/08/02
Published: (1999)

Processing and optimization of multiway spatial using R-trees. CTI Technical Report 99/04/04
Published: (1999)

Path delay fault testable modified booth multipliers. CTI Technical Report 99/07/01
Published: (1999)

CESM: a perceived software quality assessment tool. CTI Technical Report 99/08/01
Published: (1999)

Very fast,sequential and parallel aproximations to 'hard' combinatorial optimization problems. CTI Technical Report 99/06/01
Published: (1999)

Randomized approximation schemes for scheduling unrelated parallel machines. C.T. I. Technical Report TR 99/09/01

Easily path delay fault testable non resotring cellular array dividers. CTI Technical Report 99/07/05
Published: (1999)

Efficient scheduling of strict multithreaded computations C.T.I. Technical Report TR 99/01/02
Published: (1999)

Fast parallel approximation to extended positive linear programs applied to a new variation of matching C.T.I. Technical Report TR 99/01/01
Published: (1999)

A new algorith for the transversal hypergraph problem. CTI TR 99/03/03
Published: (1999)

Implementig layer-2,connection-oriented QoS on a 3-stage clos swtching architecture. CTI Technical Report TR 2000/04/04
Published: (2000)

Measuring user's perception and opinion of software quality. CTI TR 99/03/04
Published: (1999)

On the generation of spatiotemporal datasets. CTI Technical Report 99/04/03
Published: (1999)

A terabit electro-optical clos switch architecture. CTI Technical Report TR 00/11/04
Published: (2000)

Efficient decision tree induction with set-valued attributes.CTI Technical Report 99/03/01
Published: (1999)

Βιβλιοθήκη & Κέντρο Πληροφόρησης | Πανεπιστήμιο Πατρών