Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Microcalorim trie d adorption). Showing records 1 – 30 of 12944 total matches.

[1] [2] [3] [4] [5] … [432]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Lethbridge

1. University of Lethbridge. Faculty of Arts and Science. A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing .

Degree: 2015, University of Lethbridge

 This thesis proposes a k-nearest-neighbor search method inspired by the grid space partitioning and the compact trie tree structure. A detailed implementation based on the… (more)

Subjects/Keywords: nearest neighbor search; trie

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Science, U. o. L. F. o. A. a. (2015). A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/3865

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Science, University of Lethbridge. Faculty of Arts and. “A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing .” 2015. Thesis, University of Lethbridge. Accessed October 22, 2019. http://hdl.handle.net/10133/3865.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Science, University of Lethbridge. Faculty of Arts and. “A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing .” 2015. Web. 22 Oct 2019.

Vancouver:

Science UoLFoAa. A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing . [Internet] [Thesis]. University of Lethbridge; 2015. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10133/3865.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing . [Thesis]. University of Lethbridge; 2015. Available from: http://hdl.handle.net/10133/3865

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

2. Van Adrichem, D.J.A. Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform:.

Degree: 2011, Delft University of Technology

 In this thesis the design and FPGA implementation of the Range Trie with Longest Prefix Match and updates is completed and prototyped in an HTX… (more)

Subjects/Keywords: Range Trie; IP Lookup; FPGA; HyperTransport

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Van Adrichem, D. J. A. (2011). Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d5d68d7a-1c30-4594-96bf-a03a8b4b8a8f

Chicago Manual of Style (16th Edition):

Van Adrichem, D J A. “Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform:.” 2011. Masters Thesis, Delft University of Technology. Accessed October 22, 2019. http://resolver.tudelft.nl/uuid:d5d68d7a-1c30-4594-96bf-a03a8b4b8a8f.

MLA Handbook (7th Edition):

Van Adrichem, D J A. “Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform:.” 2011. Web. 22 Oct 2019.

Vancouver:

Van Adrichem DJA. Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform:. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://resolver.tudelft.nl/uuid:d5d68d7a-1c30-4594-96bf-a03a8b4b8a8f.

Council of Science Editors:

Van Adrichem DJA. Design and Prototype of the Range-Trie IP: Lookup in the HTX reconfigurable platform:. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:d5d68d7a-1c30-4594-96bf-a03a8b4b8a8f

3. Shin, Young J. Amperometric Glucose Biosensor by Means of Electrostatic Layer-by-layer Adsorption onto Electrospun Polyaniline Fibers.

Degree: 2010, Texas A&M University

 An amperometric glucose biosensor was fabricated using electospun polyaniline fibers. Polyaniline was reacted with camphorsulfonic acid to produce a salt, which was then dissolved in… (more)

Subjects/Keywords: Glucose Biosensor; Layer by Layer Adorption; Electrospinning; Polyaniline fibers

…microbalance electrodes. A 1 Hz change in △F corresponds to 0.87 ng. The film thickness (d)… …on both sides of the electrode was estimated using the following equation:34 d (nm… …REFERENCES 1. Wei, D.; Ivaska, A. Chem Anal (Warsaw) 2006, 51, 839. 2. Garjonyte, R… …Czaplewski, D. A.; Craighead, H. G. Nano Lett 2004, 4, 671. 8. Kameoka, J.; Verbridge, S. S.; Liu… …H.; Czaplewski, D. A.; Craighead, H. G. Nano Lett 2004, 4, 2105. 9. Bellan, L. M.; Kameoka… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shin, Y. J. (2010). Amperometric Glucose Biosensor by Means of Electrostatic Layer-by-layer Adsorption onto Electrospun Polyaniline Fibers. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-707

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shin, Young J. “Amperometric Glucose Biosensor by Means of Electrostatic Layer-by-layer Adsorption onto Electrospun Polyaniline Fibers.” 2010. Thesis, Texas A&M University. Accessed October 22, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-707.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shin, Young J. “Amperometric Glucose Biosensor by Means of Electrostatic Layer-by-layer Adsorption onto Electrospun Polyaniline Fibers.” 2010. Web. 22 Oct 2019.

Vancouver:

Shin YJ. Amperometric Glucose Biosensor by Means of Electrostatic Layer-by-layer Adsorption onto Electrospun Polyaniline Fibers. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-707.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shin YJ. Amperometric Glucose Biosensor by Means of Electrostatic Layer-by-layer Adsorption onto Electrospun Polyaniline Fibers. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-707

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

4. Sedlář, František. Algoritmy pro vyhledání nejdelšího shodného prefixu .

Degree: 2011, Brno University of Technology

 V této bakalářské práci byly popsány základní algoritmy pro vyhledání nejdelšího shodného prefixu (LPM). K již existujícím implementacím v knihovně Netbench byl přidán další algoritmus… (more)

Subjects/Keywords: nejdelší shodný prefix; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; binární vyhledávání na intervalech; binární vyhledávání na prefixech; longest prefix match; LPM; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; binary search on intervals; binary search on prefixes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sedlář, F. (2011). Algoritmy pro vyhledání nejdelšího shodného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/55852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu .” 2011. Web. 22 Oct 2019.

Vancouver:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/55852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

5. Mastrogeorgopoulos, C. Range Trie Software Support for Longest Prefix Match:.

Degree: 2011, Delft University of Technology

 The range trie constitutes an advanced address lookup scheme aiming at low lookup throughput, latency and memory requirements. The range trie structure has been enhanced… (more)

Subjects/Keywords: range trie; address lookup; HTX; longest prefix match

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mastrogeorgopoulos, C. (2011). Range Trie Software Support for Longest Prefix Match:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:abbdd03a-0351-4b42-8c1f-f58bb1aae90e

Chicago Manual of Style (16th Edition):

Mastrogeorgopoulos, C. “Range Trie Software Support for Longest Prefix Match:.” 2011. Masters Thesis, Delft University of Technology. Accessed October 22, 2019. http://resolver.tudelft.nl/uuid:abbdd03a-0351-4b42-8c1f-f58bb1aae90e.

MLA Handbook (7th Edition):

Mastrogeorgopoulos, C. “Range Trie Software Support for Longest Prefix Match:.” 2011. Web. 22 Oct 2019.

Vancouver:

Mastrogeorgopoulos C. Range Trie Software Support for Longest Prefix Match:. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://resolver.tudelft.nl/uuid:abbdd03a-0351-4b42-8c1f-f58bb1aae90e.

Council of Science Editors:

Mastrogeorgopoulos C. Range Trie Software Support for Longest Prefix Match:. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:abbdd03a-0351-4b42-8c1f-f58bb1aae90e


Brno University of Technology

6. Kekely, Lukáš. Hardwarová akcelerace operace hledání nejdelšího společného prefixu .

Degree: 2011, Brno University of Technology

 V této bakalářské práci je popsán návrh a implementace hardwarové architektury na hledání nejdelšího shodného prefixu s ohledem na dosáhnutí rychlosti a propustnosti požadované v… (more)

Subjects/Keywords: nejdelší shodný prefix; LPM; FPGA; hardware; vlákna; Trie; TreeBitmap; Shape-Shifting Trie; Binary Search on Prefixes; IP adresy; longest prefix match; LPM; FPGA; hardware; threads; Trie; TreeBitmap; Shape-Shifting Trie; Binary Search on Prefixes; IP address

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kekely, L. (2011). Hardwarová akcelerace operace hledání nejdelšího společného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52976

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kekely, Lukáš. “Hardwarová akcelerace operace hledání nejdelšího společného prefixu .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/52976.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kekely, Lukáš. “Hardwarová akcelerace operace hledání nejdelšího společného prefixu .” 2011. Web. 22 Oct 2019.

Vancouver:

Kekely L. Hardwarová akcelerace operace hledání nejdelšího společného prefixu . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/52976.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kekely L. Hardwarová akcelerace operace hledání nejdelšího společného prefixu . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/52976

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

7. Chrastina, Ondřej. Vyhledání nejdelšího shodného prefixu .

Degree: 2011, Brno University of Technology

 Tato práce se zabývá problémem efektivního směrování a klasifikací dat v počítačových sitích, konkrétně vyhledáním nejdelšího shodného prefixu pro síťový protokol verze 6. Jsou vybrány… (more)

Subjects/Keywords: LPM; nejdelší shodný prefix; IPv4; IPv6; algoritmus; Binární strom; Level Compressed Trie; Lulea Compressed Trie; Binární vyhledávání na intervalech.; LPM; Longest Prefix Match; IPv4; IPv6; algorithm; Binary Trie; Level Compressed Trie; Lulea Compressed Tries; Binary Search on Intervals.  

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chrastina, O. (2011). Vyhledání nejdelšího shodného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55830

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chrastina, Ondřej. “Vyhledání nejdelšího shodného prefixu .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/55830.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chrastina, Ondřej. “Vyhledání nejdelšího shodného prefixu .” 2011. Web. 22 Oct 2019.

Vancouver:

Chrastina O. Vyhledání nejdelšího shodného prefixu . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/55830.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chrastina O. Vyhledání nejdelšího shodného prefixu . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55830

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

8. Ohrádka, Marek. Grafická demonstrace vybraného algoritmu pro vyhledání směru .

Degree: 2009, Brno University of Technology

 Tato bakalářská práce se zabývá problematikou směrování v IP sítích, popisuje různé směrovací protokoly. Ukazuje možná řešení vyhledávání nejdelšího shodného prefixu, výhody a nevýhody jednotlivých… (more)

Subjects/Keywords: trie; binary trie; shape shifting trie; SST; vyhledáni nejdelšího shodného prefixu; grafická demonstrace algoritmu; vyhledáni cesty; trie; binary trie; shape shifting trie; SST; longest prefix match; algorithm graphical demonstration; route lookup

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ohrádka, M. (2009). Grafická demonstrace vybraného algoritmu pro vyhledání směru . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54691

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ohrádka, Marek. “Grafická demonstrace vybraného algoritmu pro vyhledání směru .” 2009. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/54691.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ohrádka, Marek. “Grafická demonstrace vybraného algoritmu pro vyhledání směru .” 2009. Web. 22 Oct 2019.

Vancouver:

Ohrádka M. Grafická demonstrace vybraného algoritmu pro vyhledání směru . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/54691.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ohrádka M. Grafická demonstrace vybraného algoritmu pro vyhledání směru . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/54691

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

9. Sedlář, František. Algoritmy pro vyhledání nejdelšího shodného prefixu .

Degree: 2013, Brno University of Technology

 Tato diplomová práce nejprve uvádí čtenáře do problematiky vyhledávání nejdelších shodných prefixů. Analyzuje a popisuje vybrané algoritmy se zaměřením na jejich rychlost, paměťovou náročnost a… (more)

Subjects/Keywords: nejdelší shodný prefix; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; Hash Tree Bitmap; Generic Hash Tree Bitmap; binární vyhledávání na intervalech; binární vyhledávání na prefixech; longest prefix match; LPM; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; Hash Tree Bitmap; Generic Hash Tree Bitmap; Binary Search on Intervals; Binary Search on Prefixes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sedlář, F. (2013). Algoritmy pro vyhledání nejdelšího shodného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53506

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu .” 2013. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/53506.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu .” 2013. Web. 22 Oct 2019.

Vancouver:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/53506.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/53506

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

10. Kekely, Michal. Mapování vyhledávacích tabulek z jazyka P4 do technologie FPGA .

Degree: 2016, Brno University of Technology

 Diplomová práca sa zaoberá návrhom a implementáciou mapovania vyhľadávacích tabuliek jazyka P4 do technológie FPGA. Cieľom práce bolo popísať kľúčové princípy, ktoré je potrebné pochopiť… (more)

Subjects/Keywords: P4; klasifikácia; vyhľadávacia tabuľka; kukučie hašovanie; trie; FPGA; filtrovanie paketov; DCFL; P4; classification; hash table; cuckoo hashing; trie; FPGA; packet filtering; DCFL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kekely, M. (2016). Mapování vyhledávacích tabulek z jazyka P4 do technologie FPGA . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/61848

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kekely, Michal. “Mapování vyhledávacích tabulek z jazyka P4 do technologie FPGA .” 2016. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/61848.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kekely, Michal. “Mapování vyhledávacích tabulek z jazyka P4 do technologie FPGA .” 2016. Web. 22 Oct 2019.

Vancouver:

Kekely M. Mapování vyhledávacích tabulek z jazyka P4 do technologie FPGA . [Internet] [Thesis]. Brno University of Technology; 2016. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/61848.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kekely M. Mapování vyhledávacích tabulek z jazyka P4 do technologie FPGA . [Thesis]. Brno University of Technology; 2016. Available from: http://hdl.handle.net/11012/61848

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

11. Skačan, Martin. Algoritmy pro vyhledání nejdelšího shodného prefixu .

Degree: 2010, Brno University of Technology

 Tato práce se zabývá algoritmy pro vyhledání nejdelšího shodného prefixu (longest prefix match - LPM), což je klíčová operace při klasifikaci paketů a směrování v… (more)

Subjects/Keywords: nejdelší shodný prefix; LPM; algoritmus; trie; tree bitmap; shape-shifting tree; multimatch; IP; longest prefix match; LPM; algorithm; trie; tree bitmap; shape-shifting tree; multimatch; IP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Skačan, M. (2010). Algoritmy pro vyhledání nejdelšího shodného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56127

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Skačan, Martin. “Algoritmy pro vyhledání nejdelšího shodného prefixu .” 2010. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/56127.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Skačan, Martin. “Algoritmy pro vyhledání nejdelšího shodného prefixu .” 2010. Web. 22 Oct 2019.

Vancouver:

Skačan M. Algoritmy pro vyhledání nejdelšího shodného prefixu . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/56127.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skačan M. Algoritmy pro vyhledání nejdelšího shodného prefixu . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/56127

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

12. Maršová, Eliška. Morfologický analyzátor pomocí konečných automatů .

Degree: 2013, Brno University of Technology

 Tato práce se věnuje analýze českého jazyka a pokouší se rozšířit zatím omezenou derivativní nadstavbu, kterou disponuje morfologický analyzátor MA. Autor popisuje dosavadní stav tohoto… (more)

Subjects/Keywords: Slovotvorba; derivace slov; TRIE; slovotvorné vzory; morfologická analýza; slovníková seskupení; Word formation; derivation of words; TRIE; word formation patterns; morphologic analysis; groups of words

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Maršová, E. (2013). Morfologický analyzátor pomocí konečných automatů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52885

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maršová, Eliška. “Morfologický analyzátor pomocí konečných automatů .” 2013. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/52885.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maršová, Eliška. “Morfologický analyzátor pomocí konečných automatů .” 2013. Web. 22 Oct 2019.

Vancouver:

Maršová E. Morfologický analyzátor pomocí konečných automatů . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/52885.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maršová E. Morfologický analyzátor pomocí konečných automatů . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/52885

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

13. Fomiczew, Jiří. Vizualizace algoritmů pro vyhledání nejdelšího shodného prefixu .

Degree: 2013, Brno University of Technology

 Tato práce se zabývá návrhem a implementací programu pro vizualizaci algoritmů pro vyhledání nejdelšího shodného prefixu (LPM), což je jedna z nejdůležitějších operací při klasifikaci… (more)

Subjects/Keywords: LPM; nejdelší shodný prefix; prefix; IP; Trie; Tree Bitmap; CPE; vizualizace; LPM; longest prefix match; prefix; IP; Trie; Tree Bitmap; CPE; visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fomiczew, J. (2013). Vizualizace algoritmů pro vyhledání nejdelšího shodného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54921

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fomiczew, Jiří. “Vizualizace algoritmů pro vyhledání nejdelšího shodného prefixu .” 2013. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/54921.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fomiczew, Jiří. “Vizualizace algoritmů pro vyhledání nejdelšího shodného prefixu .” 2013. Web. 22 Oct 2019.

Vancouver:

Fomiczew J. Vizualizace algoritmů pro vyhledání nejdelšího shodného prefixu . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/54921.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fomiczew J. Vizualizace algoritmů pro vyhledání nejdelšího shodného prefixu . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/54921

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

14. Weigner, Martin. Vyhledání nejdelšího shodného prefixu .

Degree: 2011, Brno University of Technology

 Rychlost počítačových sítí se neustále zvyšuje. Jednou ze základních úloh, které musí síťová zařízení provádět, je vyhledávání nejdelšího shodného prefixu. Mnoho algoritmů tuto úlohu dokáže… (more)

Subjects/Keywords: Vyhledání nejdelšího shodného prefixu; Trie; HashTreeBitmap; LPM; směrovač; IPv4; IPv6; TCP/IP.; Longest prefix match; Trie; HashTreeBitmap; LPM; router; IPv4; IPv6; TCP/IP.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Weigner, M. (2011). Vyhledání nejdelšího shodného prefixu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54129

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Weigner, Martin. “Vyhledání nejdelšího shodného prefixu .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/54129.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Weigner, Martin. “Vyhledání nejdelšího shodného prefixu .” 2011. Web. 22 Oct 2019.

Vancouver:

Weigner M. Vyhledání nejdelšího shodného prefixu . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/54129.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Weigner M. Vyhledání nejdelšího shodného prefixu . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/54129

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Linköping University

15. Björklund, Rebecka. Implementation och jämförelse av ordnade associativa arrayer.

Degree: Computer and Information Science, 2011, Linköping University

  Detta examensarbete har som syfte att titta på om strukturer, så som van Emde Boas och y-fastträd är snabbare än en standardstruktur som binärt… (more)

Subjects/Keywords: IP-uppslagning; binärt trie; van Emde Boas; y-fast; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Björklund, R. (2011). Implementation och jämförelse av ordnade associativa arrayer. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-69220

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Björklund, Rebecka. “Implementation och jämförelse av ordnade associativa arrayer.” 2011. Thesis, Linköping University. Accessed October 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-69220.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Björklund, Rebecka. “Implementation och jämförelse av ordnade associativa arrayer.” 2011. Web. 22 Oct 2019.

Vancouver:

Björklund R. Implementation och jämförelse av ordnade associativa arrayer. [Internet] [Thesis]. Linköping University; 2011. [cited 2019 Oct 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-69220.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Björklund R. Implementation och jämförelse av ordnade associativa arrayer. [Thesis]. Linköping University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-69220

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Mastrogiannopoulos, D.P. Throughput and Power optimization of the Range Trie design for IP lookups:.

Degree: 2012, Delft University of Technology

 This thesis aims to improve the Range Trie design on throughput and power consumption. The Range Trie is an SRAM based design that offers competitive… (more)

Subjects/Keywords: internet; range trie; ip lookup

Trie . . . . . . . . . . . . . . . . . . . . 2.2.5 TCAMs… …2.2.6 Search on length and search on values principles . . . . . 2.3 The Range Trie… …prototype . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.3 The proposed Range Trie… …concept to the Range Trie 3.6 Summary… …Lookup definition . . . . . . . Multibit trie . . . . . . . . . . Path compressed trie… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mastrogiannopoulos, D. P. (2012). Throughput and Power optimization of the Range Trie design for IP lookups:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:1c2f845a-1afe-4488-9446-97e9b4252b60

Chicago Manual of Style (16th Edition):

Mastrogiannopoulos, D P. “Throughput and Power optimization of the Range Trie design for IP lookups:.” 2012. Masters Thesis, Delft University of Technology. Accessed October 22, 2019. http://resolver.tudelft.nl/uuid:1c2f845a-1afe-4488-9446-97e9b4252b60.

MLA Handbook (7th Edition):

Mastrogiannopoulos, D P. “Throughput and Power optimization of the Range Trie design for IP lookups:.” 2012. Web. 22 Oct 2019.

Vancouver:

Mastrogiannopoulos DP. Throughput and Power optimization of the Range Trie design for IP lookups:. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2019 Oct 22]. Available from: http://resolver.tudelft.nl/uuid:1c2f845a-1afe-4488-9446-97e9b4252b60.

Council of Science Editors:

Mastrogiannopoulos DP. Throughput and Power optimization of the Range Trie design for IP lookups:. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:1c2f845a-1afe-4488-9446-97e9b4252b60


University of Waterloo

17. Daigle, Alexandre. Optimal Path-Decomposition of Tries.

Degree: 2016, University of Waterloo

 In this thesis, we consider the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, the… (more)

Subjects/Keywords: Auto-completion; Path-Decomposed Trie; Optimal; Data Structure; Prefix Tree; Heavy-Path

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Daigle, A. (2016). Optimal Path-Decomposition of Tries. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10491

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Daigle, Alexandre. “Optimal Path-Decomposition of Tries.” 2016. Thesis, University of Waterloo. Accessed October 22, 2019. http://hdl.handle.net/10012/10491.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Daigle, Alexandre. “Optimal Path-Decomposition of Tries.” 2016. Web. 22 Oct 2019.

Vancouver:

Daigle A. Optimal Path-Decomposition of Tries. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10012/10491.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Daigle A. Optimal Path-Decomposition of Tries. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10491

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

18. Hlavatý, Ivo. Algoritmy pro vysokorychlostní směrování v IP sítích .

Degree: 2009, Brno University of Technology

 Práce se zabývá simulací algoritmů vyhledávajících v IP sítích nejdelší shodný prefix, konkrétně Trie, Tree Bitmap a Shape Shifting Trie. Algoritmy jsou implementovány softwarově a… (more)

Subjects/Keywords: Trie; Tree Bitmap; Shape Shifting Trie; paměťové nároky; IP; nejdelší shodný prefix; Trie; Tree Bitmap; Shape Shifting Trie; memory requirements; IP; longest matching prefix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hlavatý, I. (2009). Algoritmy pro vysokorychlostní směrování v IP sítích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54572

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hlavatý, Ivo. “Algoritmy pro vysokorychlostní směrování v IP sítích .” 2009. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/54572.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hlavatý, Ivo. “Algoritmy pro vysokorychlostní směrování v IP sítích .” 2009. Web. 22 Oct 2019.

Vancouver:

Hlavatý I. Algoritmy pro vysokorychlostní směrování v IP sítích . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/54572.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hlavatý I. Algoritmy pro vysokorychlostní směrování v IP sítích . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/54572

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

19. Ženčák, Tomáš. Generování binárního prefixového stromu podle pravděpodobnostních parametrů .

Degree: 2017, Brno University of Technology

 Cílem této práce je vytvořit generátor prefixových sad, který bude schopný vygenerovat prefixovou sadu na základě parametrů specifikovaných v sadě nástrojů ClassBench. V této práci… (more)

Subjects/Keywords: IP prefix sets; generation; trie; ClassBench; sady IP prefixů; generování; prefixový strom; ClassBench

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ženčák, T. (2017). Generování binárního prefixového stromu podle pravděpodobnostních parametrů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69781

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ženčák, Tomáš. “Generování binárního prefixového stromu podle pravděpodobnostních parametrů .” 2017. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/69781.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ženčák, Tomáš. “Generování binárního prefixového stromu podle pravděpodobnostních parametrů .” 2017. Web. 22 Oct 2019.

Vancouver:

Ženčák T. Generování binárního prefixového stromu podle pravděpodobnostních parametrů . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/69781.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ženčák T. Generování binárního prefixového stromu podle pravděpodobnostních parametrů . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/69781

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Southern California

20. Le, Hoang Xuan. High performance architectures for large-scale packet forwarding and string pattern matching.

Degree: PhD, Computer Engineering, 2011, University of Southern California

 The internet has grown explosively to a giant open network. Routers in the backbone should simply move traffic as fast as possible. However, packet forwarding… (more)

Subjects/Keywords: network routers; IP lookup; packet forwarding; FPGA; NDIS; trie-based IP lookup; tree-based IP lookup; string matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Le, H. X. (2011). High performance architectures for large-scale packet forwarding and string pattern matching. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168

Chicago Manual of Style (16th Edition):

Le, Hoang Xuan. “High performance architectures for large-scale packet forwarding and string pattern matching.” 2011. Doctoral Dissertation, University of Southern California. Accessed October 22, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168.

MLA Handbook (7th Edition):

Le, Hoang Xuan. “High performance architectures for large-scale packet forwarding and string pattern matching.” 2011. Web. 22 Oct 2019.

Vancouver:

Le HX. High performance architectures for large-scale packet forwarding and string pattern matching. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2019 Oct 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168.

Council of Science Editors:

Le HX. High performance architectures for large-scale packet forwarding and string pattern matching. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168


Brno University of Technology

21. Juránek, Michal. Detekce dynamických síťových aplikací .

Degree: 2011, Brno University of Technology

 Tato bakalářská práce popisuje způsoby detekce šifrované komunikace jednoduchých hlasových hovorů VoIP mezi dvěma klienty aplikace Skype. Popsány jsou prvky sítě a principy komunikace. Analyzovány… (more)

Subjects/Keywords: Skype; VoIP; klasifikace síťového provozu; naivní bayesovský klasifikátor; Pearsonův test dobré shody; detekce síťové komunikace; pcap; trie; SILK; Skype; VoIP; classification of network traffic; naive Bayesian classification; Pearson's test of goodness of fit; detection of network communication; pcap; trie; SILK

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Juránek, M. (2011). Detekce dynamických síťových aplikací . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55641

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Juránek, Michal. “Detekce dynamických síťových aplikací .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/55641.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Juránek, Michal. “Detekce dynamických síťových aplikací .” 2011. Web. 22 Oct 2019.

Vancouver:

Juránek M. Detekce dynamických síťových aplikací . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/55641.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Juránek M. Detekce dynamických síťových aplikací . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55641

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

22. Černý, Stanislav. Morfologický analyzátor pomocí konečných automatů .

Degree: 2008, Brno University of Technology

 V textu je popsán morfologický analyzátor češtiny, který využívá slovníkový přístup. Slovník je uložen pomocí deterministického konečného automatu. Další část textu je zaměřena na analýzu… (more)

Subjects/Keywords: morfologický analyzátor; TRIE; deterministický konečný automat; číslovky; slovotvorné vazby; morphemic analyser; TRIE; deterministic finite state automata; numerals; word-formation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Černý, S. (2008). Morfologický analyzátor pomocí konečných automatů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55563

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Černý, Stanislav. “Morfologický analyzátor pomocí konečných automatů .” 2008. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/55563.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Černý, Stanislav. “Morfologický analyzátor pomocí konečných automatů .” 2008. Web. 22 Oct 2019.

Vancouver:

Černý S. Morfologický analyzátor pomocí konečných automatů . [Internet] [Thesis]. Brno University of Technology; 2008. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/55563.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Černý S. Morfologický analyzátor pomocí konečných automatů . [Thesis]. Brno University of Technology; 2008. Available from: http://hdl.handle.net/11012/55563

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

23. Veselý, Lukáš. Korektor diakritiky .

Degree: 2007, Brno University of Technology

 Cílem předkládané práce je návrh a implementace aplikace, umožňující doplňování a naopak odstranění diakritiky v česky psaném textu. Popsána je použitá vyhledávací struktura trie a… (more)

Subjects/Keywords: diakritika; Java; konečný automat; minimalizace; slovník; struktura trie; unigramový model; diacritic; Java; finite state automata; minimalization; dictionary; structure trie; unigram model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Veselý, L. (2007). Korektor diakritiky . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53959

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Veselý, Lukáš. “Korektor diakritiky .” 2007. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/53959.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Veselý, Lukáš. “Korektor diakritiky .” 2007. Web. 22 Oct 2019.

Vancouver:

Veselý L. Korektor diakritiky . [Internet] [Thesis]. Brno University of Technology; 2007. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/53959.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Veselý L. Korektor diakritiky . [Thesis]. Brno University of Technology; 2007. Available from: http://hdl.handle.net/11012/53959

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

24. Picek, Radomír. Scrabble .

Degree: 2008, Brno University of Technology

 Tato diplomová práce se zabývá stolní společenskou hrou SCRABBLE a její realizací v podobě počítačové hry. Postupně rozebírá všechny důležité aspekty, které mají vliv na výkonnost… (more)

Subjects/Keywords: Scrabble; backtracking; teorie her; minimax; Trie; DAWG; GADDAG.; Scrabble; backtracking; game theory; minimax; Trie; DAWG; GADDAG.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Picek, R. (2008). Scrabble . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53233

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Picek, Radomír. “Scrabble .” 2008. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/53233.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Picek, Radomír. “Scrabble .” 2008. Web. 22 Oct 2019.

Vancouver:

Picek R. Scrabble . [Internet] [Thesis]. Brno University of Technology; 2008. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/53233.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Picek R. Scrabble . [Thesis]. Brno University of Technology; 2008. Available from: http://hdl.handle.net/11012/53233

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

25. Gach, Tomáš. Kompresní metody založené na kontextovém modelování .

Degree: 2011, Brno University of Technology

 Cílem této práce je popsat základní vlastnosti kontextových kompresních metod. Proces modelování je uveden společně s principem aritmetického kódování. Postupně jsou představeny metody PPM, CTW… (more)

Subjects/Keywords: Komprese dat; bezeztrátová komprese; statistické metody; kontextové metody; aritmetické kódování; PPM; trie; CTW; PAQ; Silesia Corpus; Calgary Corpus.; Data compression; lossless data compression; statistical methods; context – based methods; arithmetic coding; PPM; trie; CTW; PAQ; Silesia Corpus; Calgary Corpus.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gach, T. (2011). Kompresní metody založené na kontextovém modelování . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55801

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gach, Tomáš. “Kompresní metody založené na kontextovém modelování .” 2011. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/55801.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gach, Tomáš. “Kompresní metody založené na kontextovém modelování .” 2011. Web. 22 Oct 2019.

Vancouver:

Gach T. Kompresní metody založené na kontextovém modelování . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/55801.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gach T. Kompresní metody založené na kontextovém modelování . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55801

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

26. Klocok, Andrej. Systém slovenské morfologie založený na vzorech .

Degree: 2017, Brno University of Technology

 Cieľom tejto práce je zoznámenie sa s metódami morfologickej analýzy, reprezentáciou dát morfologických slovníkov, vytvorením systému technických vzorov pre flektívnu morfológiu slovenčiny. Z tohto systému… (more)

Subjects/Keywords: morfologická analýza; morfologický analyzátor; lematizácia; lema; morfologický slovník; trie; nástroj pre porovnanie a vyhodnocovanie stemerov; nástroj na rekonštrukciu diakritiky; slovenský korpus; morphological analysis; morphological analyzer; lemmatization; lemma; morphological dictionary; trie; tool for comparison and evaluation of stemmers; tool for reconstruction of diacritics; Slovak corpora

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Klocok, A. (2017). Systém slovenské morfologie založený na vzorech . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69675

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Klocok, Andrej. “Systém slovenské morfologie založený na vzorech .” 2017. Thesis, Brno University of Technology. Accessed October 22, 2019. http://hdl.handle.net/11012/69675.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Klocok, Andrej. “Systém slovenské morfologie založený na vzorech .” 2017. Web. 22 Oct 2019.

Vancouver:

Klocok A. Systém slovenské morfologie založený na vzorech . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11012/69675.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Klocok A. Systém slovenské morfologie založený na vzorech . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/69675

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

27. Karras, Spyridon. Μελέτη της συσχέτισης της βιταμίνης D στη μητέρα και στο νεογνό κατά τον τοκετό με την ομοιοστασία του ασβεστίου και τα σωματομετρικά χαρακτηριστικά του νεογνού.

Degree: 2015, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

 SummaryIntroduction. Concentrations of vitamin D during pregnancy are very important. The adequacy of vitamin D during pregnancy is essential for the normal development of the… (more)

Subjects/Keywords: Bιταμίνη D; Vitamin D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Karras, S. (2015). Μελέτη της συσχέτισης της βιταμίνης D στη μητέρα και στο νεογνό κατά τον τοκετό με την ομοιοστασία του ασβεστίου και τα σωματομετρικά χαρακτηριστικά του νεογνού. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/35757

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Karras, Spyridon. “Μελέτη της συσχέτισης της βιταμίνης D στη μητέρα και στο νεογνό κατά τον τοκετό με την ομοιοστασία του ασβεστίου και τα σωματομετρικά χαρακτηριστικά του νεογνού.” 2015. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed October 22, 2019. http://hdl.handle.net/10442/hedi/35757.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Karras, Spyridon. “Μελέτη της συσχέτισης της βιταμίνης D στη μητέρα και στο νεογνό κατά τον τοκετό με την ομοιοστασία του ασβεστίου και τα σωματομετρικά χαρακτηριστικά του νεογνού.” 2015. Web. 22 Oct 2019.

Vancouver:

Karras S. Μελέτη της συσχέτισης της βιταμίνης D στη μητέρα και στο νεογνό κατά τον τοκετό με την ομοιοστασία του ασβεστίου και τα σωματομετρικά χαρακτηριστικά του νεογνού. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2015. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10442/hedi/35757.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Karras S. Μελέτη της συσχέτισης της βιταμίνης D στη μητέρα και στο νεογνό κατά τον τοκετό με την ομοιοστασία του ασβεστίου και τα σωματομετρικά χαρακτηριστικά του νεογνού. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2015. Available from: http://hdl.handle.net/10442/hedi/35757

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Yu, Heeyeol. Power and Memory Efficient Hashing Schemes for Some Network Applications.

Degree: 2010, Texas A&M University

 Hash tables (HTs) are used to implement various lookup schemes and they need to be efficient in terms of speed, space utilization, and power consumptions.… (more)

Subjects/Keywords: Packet processing; IP lookup; TCAM; Trie; Bloom filter; Hahs table.

…Hash Table HCAM Hybrid CAM SMT Segmented Multibit Trie ix TABLE OF CONTENTS CHAPTER… …WORKS IN PACKET PROCESSING . . . . . . . . 9 A. B. C. D. III IP Lookup… …3. IPv6 IP Lookup . . . . . . . . . . . . . . . . D. Packet Classification Using Hashing… …A. B. C. D. . . . . . . . . . . . . . . . . . . . . 15 18 20 20 21 22 23… …successful lookup . . . 2. False classification in an unsuccessful lookup D. Delete Operation in an… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yu, H. (2010). Power and Memory Efficient Hashing Schemes for Some Network Applications. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-364

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Yu, Heeyeol. “Power and Memory Efficient Hashing Schemes for Some Network Applications.” 2010. Thesis, Texas A&M University. Accessed October 22, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-364.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yu, Heeyeol. “Power and Memory Efficient Hashing Schemes for Some Network Applications.” 2010. Web. 22 Oct 2019.

Vancouver:

Yu H. Power and Memory Efficient Hashing Schemes for Some Network Applications. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-364.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yu H. Power and Memory Efficient Hashing Schemes for Some Network Applications. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-364

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Georgia

29. Williams, Jamie Michelle. Vitamin D and muscle relationships in early adolescents.

Degree: MS, Foods and Nutrition, 2011, University of Georgia

 While optimal vitamin D nutriture and muscle development in children are both important for long-term bone health, little is known about the relationship between vitamin… (more)

Subjects/Keywords: Vitamin D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Williams, J. M. (2011). Vitamin D and muscle relationships in early adolescents. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/williams_jamie_m_201105_ms

Chicago Manual of Style (16th Edition):

Williams, Jamie Michelle. “Vitamin D and muscle relationships in early adolescents.” 2011. Masters Thesis, University of Georgia. Accessed October 22, 2019. http://purl.galileo.usg.edu/uga_etd/williams_jamie_m_201105_ms.

MLA Handbook (7th Edition):

Williams, Jamie Michelle. “Vitamin D and muscle relationships in early adolescents.” 2011. Web. 22 Oct 2019.

Vancouver:

Williams JM. Vitamin D and muscle relationships in early adolescents. [Internet] [Masters thesis]. University of Georgia; 2011. [cited 2019 Oct 22]. Available from: http://purl.galileo.usg.edu/uga_etd/williams_jamie_m_201105_ms.

Council of Science Editors:

Williams JM. Vitamin D and muscle relationships in early adolescents. [Masters Thesis]. University of Georgia; 2011. Available from: http://purl.galileo.usg.edu/uga_etd/williams_jamie_m_201105_ms


University of Debrecen

30. Jenei, Petra. Neoglikoproteinek előállítása D-mannóz hídmolekulával .

Degree: DE – TEK – Természettudományi és Technológiai Kar – Biológiai és Ökológiai Intézet, 2010, University of Debrecen

Feladatom volt D-mannózt és az általam előállított manno oligoszacharidokat ezzell a módszerrel a fehérjéhez,borjú szérum albuminhoz(BSA) kapcsolni. Advisors/Committee Members: Szurmai, Zoltán (advisor).

Subjects/Keywords: D-mannóz

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jenei, P. (2010). Neoglikoproteinek előállítása D-mannóz hídmolekulával . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/95976

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jenei, Petra. “Neoglikoproteinek előállítása D-mannóz hídmolekulával .” 2010. Thesis, University of Debrecen. Accessed October 22, 2019. http://hdl.handle.net/2437/95976.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jenei, Petra. “Neoglikoproteinek előállítása D-mannóz hídmolekulával .” 2010. Web. 22 Oct 2019.

Vancouver:

Jenei P. Neoglikoproteinek előállítása D-mannóz hídmolekulával . [Internet] [Thesis]. University of Debrecen; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/2437/95976.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jenei P. Neoglikoproteinek előállítása D-mannóz hídmolekulával . [Thesis]. University of Debrecen; 2010. Available from: http://hdl.handle.net/2437/95976

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [432]

.