Relevant bibliographies by topics / Digital search tree

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Digital search tree'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Digital search tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Digital search tree"

1

Vosselman, George. "Applications of tree search methods in digital photogrammetry." ISPRS Journal of Photogrammetry and Remote Sensing 50, no. 4 (August 1995): 29–37. http://dx.doi.org/10.1016/0924-2716(95)98235-r.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Holmgren, Cecilia. "A weakly 1-stable distribution for the number of random records and cuttings in split trees." Advances in Applied Probability 43, no. 01 (March 2011): 151–77. http://dx.doi.org/10.1017/s0001867800004730.

Full text
Abstract:
In this paper we study the number of random records in an arbitrary split tree (or, equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for the convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. After normalization the distributions are shown to be asymptotically weakly 1-stable. This work is a generalization of our earlier results for the random binary search tree in Holmgren (2010), which is one specific case of split trees. Other important examples of split trees includem-ary search trees, quad trees, medians of (2k+ 1)-trees, simplex trees, tries, and digital search trees.
APA, Harvard, Vancouver, ISO, and other styles
3

Holmgren, Cecilia. "A weakly 1-stable distribution for the number of random records and cuttings in split trees." Advances in Applied Probability 43, no. 1 (March 2011): 151–77. http://dx.doi.org/10.1239/aap/1300198517.

Full text
Abstract:
In this paper we study the number of random records in an arbitrary split tree (or, equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for the convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. After normalization the distributions are shown to be asymptotically weakly 1-stable. This work is a generalization of our earlier results for the random binary search tree in Holmgren (2010), which is one specific case of split trees. Other important examples of split trees include m-ary search trees, quad trees, medians of (2k + 1)-trees, simplex trees, tries, and digital search trees.
APA, Harvard, Vancouver, ISO, and other styles
4

Pittel, Boris. "Paths in a random digital tree: limiting distributions." Advances in Applied Probability 18, no. 01 (March 1986): 139–55. http://dx.doi.org/10.1017/s0001867800015603.

Full text
Abstract:
We study a rule of growing a sequence {tn } of finite subtrees of an infinite m-ary tree T. Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a sequence of paths in T. The tree tn is obtained by cutting each , at the first node such that at most σ paths out of , pass through it. Denote by Hn the length of the longest path, hn the length of the shortest path, and Ln the length of the randomly chosen path in tn. It is shown that, in probability, Hn – loga n = O(1), hn – log b (n/log n) = 0(1), (or hn – log b (n/log log n) = O(1)), and that is asymptotically normal. The parameters a, b, c depend on the distribution of ω and, in case of a, also on σ. These estimates describe respectively the worst, the best and the typical case behavior of a ‘trie’ search algorithm for a dictionary-type information retrieval system, with σ being the capacity of a page.
APA, Harvard, Vancouver, ISO, and other styles
5

Pittel, Boris. "Paths in a random digital tree: limiting distributions." Advances in Applied Probability 18, no. 1 (March 1986): 139–55. http://dx.doi.org/10.2307/1427240.

Full text
Abstract:
We study a rule of growing a sequence {tn} of finite subtrees of an infinite m-ary tree T. Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a sequence of paths in T. The tree tn is obtained by cutting each , at the first node such that at most σ paths out of , pass through it. Denote by Hn the length of the longest path, hn the length of the shortest path, and Ln the length of the randomly chosen path in tn. It is shown that, in probability, Hn – logan = O(1), hn – logb (n/log n) = 0(1), (or hn – logb (n/log log n) = O(1)), and that is asymptotically normal. The parameters a, b, c depend on the distribution of ω and, in case of a, also on σ. These estimates describe respectively the worst, the best and the typical case behavior of a ‘trie’ search algorithm for a dictionary-type information retrieval system, with σ being the capacity of a page.
APA, Harvard, Vancouver, ISO, and other styles
6

ZINCIR-HEYWOOD, A. N., M. I. HEYWOOD, C. R. CHARTWIN, and T. TUNALI. "HETEROGENEOUS DIGITAL LIBRARY QUERY PLATFORM USING A TRULY DISTRIBUTED MULTI-AGENT SEARCH." International Journal of Cooperative Information Systems 09, no. 03 (September 2000): 229–54. http://dx.doi.org/10.1142/s0218843000000132.

Full text
Abstract:
A platform for performing multi-agent searches in heterogeneous digital libraries is proposed. This differs significantly from previous approaches by completely removing the concept of a centralized search engine. Specifically, the organization of information held on domain index servers is constrained to conform to a virtual tree representation based on facets and global keyword concept schema particular to the set of information providers associated with the domain of interest (e.g. preparatory intranet). Simulation studies are used to compare this platform against a digital library platform presently in use, which employs the traditional central server scheme. Improvements in terms of query service time and robustness are demonstrated.
APA, Harvard, Vancouver, ISO, and other styles
7

Louchard, Guy, Wojciech Szpankowski, and Jing Tang. "Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm." SIAM Journal on Computing 28, no. 3 (January 1998): 904–34. http://dx.doi.org/10.1137/s0097539796301811.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Song, Yue, Minjuan Wang, and Wanlin Gao. "Method for Retrieving Digital Agricultural Text Information Based on Local Matching." Symmetry 12, no. 7 (July 2, 2020): 1103. http://dx.doi.org/10.3390/sym12071103.

Full text
Abstract:
In order to improve the retrieval results of digital agricultural text information and improve the efficiency of retrieval, the method for searching digital agricultural text information based on local matching is proposed. The agricultural text tree and the query tree are constructed to generate the relationship of ancestor–descendant in the query and map it to the agricultural text. According to the retrieval method of the local matching, the vector retrieval method is used to calculate the digital agricultural text and submit the similarity between the queries. The similarity is sorted from large to small so that the agricultural text tree can output digital agricultural text information in turn. In the case of adding interference information, the recall rate and precision rate of the proposed method are above 99.5%; the average retrieval time is between 4s and 6s, and the average retrieval efficiency is above 99%. The proposed method is more efficient in information retrieval and can obtain comprehensive and accurate search results, which can be used for the rapid retrieval of digital agricultural text information.
APA, Harvard, Vancouver, ISO, and other styles
9

Johnson, Derek, Erin Faulkner, Georgia Meredith, and Tim J. Wilson. "Police Functional Adaptation to the Digital or Post Digital Age: Discussions with Cybercrime Experts." Journal of Criminal Law 84, no. 5 (September 23, 2020): 427–50. http://dx.doi.org/10.1177/0022018320952559.

Full text
Abstract:
This article examines the challenges of functional adaptation faced by the police in response to technologically driven changes in the nature of crime. It also recounts how research under the auspices of a ‘dark web’ research project resulted in a search for an effective approach to engaging with investigators dealing with cybercrime. In doing so it tested, as a research methodology, a standard change implementation tool (problem tree analysis) from the Disaster Management and Sustainable Development (DMSD) discipline. This in turn resulted in significant consideration being given to the physical space in which that methodology is used. It presents the results of a workshop held with cybercrime investigators (not all were police officers) in terms of the importance of four key organisational and cultural issues (management, leadership and institutional ethos within the police; the risks of over-complication and exaggerated distinctions between cyber and real world policing; ethics; and knowledge, training and development) alongside the development and acquisition of new technical capabilities.
APA, Harvard, Vancouver, ISO, and other styles
10

Shi, Wenkui, Jianqiang Chen, Yanming Shen, and Yi Jiang. "SPH Method with Space-Based Variable Smoothing Length and Its Applications to Free Surface Flow." International Journal of Computational Methods 16, no. 02 (November 29, 2018): 1846002. http://dx.doi.org/10.1142/s0219876218460027.

Full text
Abstract:
In order to improve the computational efficiency and spatial resolution of smoothed particle hydrodynamics (SPH) method, a SPH method with space-based variable smoothing length has been developed. In addition, since linked-list search algorithm cannot handle the variable smoothing length problems, an improved linked-list search algorithm and a balanced alternating digital tree (B-ADT) search algorithm have been proposed. The performance of the two improved search algorithms has been evaluated in detail. These methods have been used to simulate two cases of water entry impact and two cases of gas–liquid two-phase flow. The results show that, by using space-based variable smoothing length algorithm, computational cost can be greatly reduced and the numerical accuracy is maintained.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Digital search tree"

1

Cénac, Peggy. "Étude statistique de séquences biologiques et convergence de martingales." Toulouse 3, 2006. http://www.theses.fr/2006TOU30065.

Full text
Abstract:
Le système dynamique Chaos Game Representation associe à une suite de lettres dans un alphabet fini, une mesure empirique sur un ensemble. Fournit-elle plus d'information que les méthodes de comptage de mots classiques ? A partir d'une caractérisation basée sur la CGR, on propose une nouvelle famille de tests donnant l'ordre d'une chaîne de Markov homogène. On définit ensuite une construction d'arbres digitaux de recherche, inspirés par la CGR, en insérant successivement les préfixes retournés d'une chaîne de Markov. On montre que les longueurs des branches critiques se comportent, au premier ordre, comme si les séquences insérées étaient indépendantes entre elles. La dernière partie est consacrée à l'étude de la convergence presque sûre des moments normalisés de tout ordre de martingales vectorielles dans le théorème de la limite centrale presque sûr. Les résultats sont appliqués aux erreurs d'estimation et de prédiction dans les régressions linéaires et les processus de branchement
The Chaos Game Representation is a dynamical system which maps a sequence of letters taken from a finite alphabet onto an empirical measure on a set. We show how the CGR can be used to characterize the order of an homogeneous Markov chain and to define a new family of tests. Then we propose a construction of Digital Search Trees, inspired from the CGR, by successively inserting all the returned prefixes of a Markov chain. We give the asymptotic behavior of the critical lengths of paths, which turns out to be, at first order, the same one as in the case of DST built from independent Markov chains. A last part deals with properties of almost sure convergence of vectorial martingales. Under suitable regularity conditions on the growing process, we establish the convergence of normalized moments of all orders in the almost sure central limit theorem. The results are applied to the cumulated errors of estimation and prediction in linear regression models and branching processes
APA, Harvard, Vancouver, ISO, and other styles
2

Fuchs, Adriaan. "In search of the "true" sound of an artist : a study of recordings by Maria Callas." Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/17355.

Full text
Abstract:
Thesis (M. Phil. (Music Technology)) -- University of Stellenbosch, 2006.
ENGLISH ABSTRACT: Modern digital signal processing, allowing a much greater degree of flexibility in audio processing and therefore greater potential for noise removal, pitch correction, filtering and editing, has allowed transfer and audio restoration engineers a diversity of ways in which to “improve” or “reinterpret” (in some cases even drastically altering) the original sound of recordings. This has lead to contrasting views regarding the role of the remastering engineer, the nature and purpose of audio restoration and the ethical implications of the restoration process. The influence of audio restoration on the recorded legacy of a performing artist is clearly illustrated in the case of Maria Callas (1923 - 1977), widely regarded not only as one of the most influential and prolific of opera singers, but also one of the greatest classical musicians of all time. EMI, for whom Callas recorded almost exclusively from 1953 - 1969, has reissued her recordings repeatedly, continually adapting their sound “to the perceived preferences of the record-buying public” (Seletsky 2000: 240). Their attempts at improving the sound of Callas’s recordings to meet with the sonic quality expected of modern recordings, as reissued in the latest releases that form part of EMI’s Callas Edition, Great Recordings of the Century (GROTC) and Historical Series, have resulted in often staggeringly different reinterpretations of the same audio material that bear no resemblance to previous CD or LP incarnations or “evince no consolidated conviction about exactly how Callas’s voice should sound.” In essence, some commentators argue that the “Callas sound” we hear on recent CD releases is not necessarily exactly as the great diva might have sounded. The purpose of this study is to consider the influence of audio restoration and remastering techniques on the recorded legacy of Callas, by illustrating the sometimes startlingly different ways in which her voice has been made to sound, examining and comparing the way in which different remasterings of the same audio material can vary in quality, as well as demonstrating how vastly different sonic reinterpretations of a single recording can affect our perception of an artist’s “true” sound. To this end, various reissues of six different complete opera recordings, including four studio recordings: Tosca (1953), Lucia di Lammermoor (1953), Norma (1954), Madama Butterfly (1955), as well as two “live” performances of Macbeth (1953) and La Traviata (1958), have been evaluated and compared, using the “true” sound of Callas’s voice as reference in comparing the different remasterings. Pitch and frequency spectrum analysis was used to confirm or support any subjective claims and observations and further analysis performed with the aid of a specialised Matlab algorithm.
AFRIKAANSE OPSOMMING: Moderne digitale seinprossesering bied kragtige en veelsydige moontlikhede vir die verwerking van klankseine. Die groter potensiaal vir ruisverwydering, toonhoogte verstelling, filtrering en redigering van opnames bied klankingenieurs ‘n wye verskeidenheid van maniere om die oorspronklike klank van opnames te verbeter, te interpreteer en soms ingrypend te verander. Dit het aanleiding gegee tot teenstrydige en uiteenlopende menings oor die funksie van die klankrestourasie-ingenieur, die aard en doel van klankrestourasie en die etiese gevolge van die restourasieproses. Die invloed van klankrestourasie op die klanknalatenskap van ‘n uitvoerende kunstenaar kan duidelik bestudeer word in die geval van Maria Callas (1923 – 1977), algemeen aanvaar as een van die mees invloedryke en grootse klassieke musici van alle tye. Die platemaatskappy EMI, vir wie Callas feitlik uitsluitlik vanaf 1953 tot 1969 opgeneem het, het haar klankopnames reeds verskeie kere heruitgereik en die klank daarvan deurlopend aangepas om aanklank te vind by die “veronderstelde voorkeure van die publiek” (Seletsky 2000: 240). EMI se pogings om die klank van Callas se opnames te verbeter om aan die klankvereistes van moderne opnames te voldoen, het ontaard in dikwels aangrypend verskillende interpretasies van dieselfde audio materiaal wat geen ooreenkomste toon met vorige laserskyf of langspeelplaat uitgawes nie, asook “geen vasgestelde oortuigings openbaar oor hoe Callas se stem presies moet klink nie.” Sommige critici argumenteer dat die “Callas klank” wat ons op hedendaagse CD uitgawes hoor, nie noodwendig klink soos wat Callas werklik geklink het nie. Die doel van hierdie studie is om die invloed van klankrestourasie op die klanknalatenskap van Callas te bestudeer deur die verskillende wyses waarop die klank van haar stem aangepas is te illustreer, die verskille in klankkwaliteit tussen verskillende uitgawes van dieselfde materiaal te ondersoek en te vergelyk, asook te demonstreer hoe uiteenlopend verskillende interpretasies van ‘n enkele opname die persepsie van ‘n kunstenaar se “ware” klank kan affekteer. Vir hierdie doel is verkeie uitgawes van ses verskillende volledige opera opnames, insluitend vier studio opnames van onderskeidelik Tosca (1953), Lucia di Lammermoor (1953), Norma (1954) en Madama Butterfly (1955), asook twee “lewendige” opnames van Macbeth (1952) en La Traviata (1958) bestudeer deur Callas se “ware” klank as maatstaf te gebruik om die onderskeie opnames te vergelyk. Toonhoogte- en frekwensie spektrum analise, asook analise deur middel van ‘n gespesialiseerde Matlab algoritme, is deurlopend gebruik om enige subjektiewe gevolgtrekkings en waarnemings te staaf.
APA, Harvard, Vancouver, ISO, and other styles
3

Tseng, Po-Han, and 曾柏翰. "Probabilistic Analysis of Digital Search Trees–Old and New Results." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/07995113404125435558.

Full text
Abstract:
碩士
國立交通大學
應用數學系所
96
Digital search trees (DSTs for short) and their generalizations such as bucket digital search trees (b-DSTs) are fundamental data structures in computer science. These trees are built from records whose keys consist of 0-1 strings. In this thesis, we will consider random DSTs which are obtained by assuming that the bits of the keys are randomly generated. Characteristic parameters of random DSTs are random variables and their analysis has attracted a lot of attention in recent decades. Examples of parameters considered in previous works include: the depth of a random node [5, 12, 15, 17, 18, 19, 20, 22], the distance of two random nodes [1], the number of external-internal nodes [5, 9, 15, 21, 13], the internal path length [5, 8, 10, 14], and the size of the tree [4, 9]. For the analysis, several interesting methods have been proposed, most of them belonging to the field of analytic combinatorics. In this thesis, we focus on the internal path length of DSTs. We will introduce the techniques which have been devised for the analysis of the internal path length. Moreover, we will give a new method, which will appear in a forthcoming work of Fuchs, Hwang, and Zacharovas, to improve the analysis of the internal path length of b-DSTs. The purpose of this thesis is twofold. First, we want to give a self-contained survey of the techniques used in the analysis of DSTs and the results achieved. Here, we will mainly follow previous works, but also introduce some technical improvements. Secondly, we are going to use the new approach of Fuchs, Hwang, and Zacharovas mentioned above to obtain exact and numerical results concerning the leading constant in the asymptotic expansion of the variance. In particular, our results will simplify and improve previous results. This thesis is organized as follows: in Chapter 1, we introduce the techniques which are of importance in the analysis of DSTs. In Chapter 2, we present results concerning mean value and variance of the internal path length and explain how they can be proved with the methods from Chapter 1. Moreover, we also give a short survey of results concerning other parameters. In Chapter 3, we introduce the new method and explain our new findings concerning the leading constant of the variance.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Digital search tree"

1

Winands, Mark H. M. "Monte-Carlo Tree Search in Board Games." In Handbook of Digital Games and Entertainment Technologies, 47–76. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-4560-50-4_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Winands, Mark H. M. "Monte-Carlo Tree Search in Board Games." In Handbook of Digital Games and Entertainment Technologies, 1–30. Singapore: Springer Singapore, 2015. http://dx.doi.org/10.1007/978-981-4560-52-8_27-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ferreira, Margarida, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, and Ruben Martins. "FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions." In Tools and Algorithms for the Construction and Analysis of Systems, 152–69. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_9.

Full text
Abstract:
AbstractForm validators based on regular expressions are often used on digital forms to prevent users from inserting data in the wrong format. However, writing these validators can pose a challenge to some users.We present Forest, a regular expression synthesizer for digital form validations. Forest produces a regular expression that matches the desired pattern for the input values and a set of conditions over capturing groups that ensure the validity of integer values in the input. Our synthesis procedure is based on enumerative search and uses a Satisfiability Modulo Theories (SMT) solver to explore and prune the search space. We propose a novel representation for regular expressions synthesis, multi-tree, which induces patterns in the examples and uses them to split the problem through a divide-and-conquer approach. We also present a new SMT encoding to synthesize capture conditions for a given regular expression. To increase confidence in the synthesized regular expression, we implement user interaction based on distinguishing inputs.We evaluated Forest on real-world form-validation instances using regular expressions. Experimental results show that Forest successfully returns the desired regular expression in 70% of the instances and outperforms Regel, a state-of-the-art regular expression synthesizer.
APA, Harvard, Vancouver, ISO, and other styles
4

Kirschenhofer, Peter, and Helmut Prodinger. "Some further results on digital search trees." In Automata, Languages and Programming, 177–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16761-7_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lanlignel, Jean-Marc, Olivier Raynaud, and Eric Thierry. "Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs." In STACS 2000, 529–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-46541-3_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

"◾ Development of a Framework for the Desktop Grid Federation of Game Tree Search Applications." In Cloud Computing and Digital Media, 257–76. Chapman and Hall/CRC, 2014. http://dx.doi.org/10.1201/b16614-14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nikolaidis, Nikos. "Digital Rights Management of Images and Videos Using Robust Replica Detection Techniques." In Digital Rights Management for E-Commerce Systems, 159–76. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-118-6.ch007.

Full text
Abstract:
Intellectual property rights protection and management of multimedia data is essential for the deployment of e-commerce systems involving transactions on such data. Lately, replica detection or fingerprinting has emerged as a promising approach for the rights management of multimedia data. In this chapter, a review of 2 replica detection techniques is presented. The first technique utilizes color-based descriptors, an R-tree indexing structure, and Linear Discriminant Analysis (LDA) to achieve image replica detection. The second technique is a video fingerprinting method that utilizes information about the appearances of individuals in videos along with an efficient search and matching strategy.
APA, Harvard, Vancouver, ISO, and other styles
8

Apostolico, A. "On-line String Searching." In Pattern Matching Algorithms. Oxford University Press, 1997. http://dx.doi.org/10.1093/oso/9780195113679.003.0006.

Full text
Abstract:
In the previous two chapters, we have examined various serial and parallel methods to perform exact string searching in a number of operations proportional to the total length of the input. Even though such a performance is optimal, our treatment of exact searches cannot be considered exhausted yet: in many applications, searches for different, a-priorily unknown patterns are performed on a same text or group of texts. It seems natural to ask whether these cases can be handled better than by plain reiteration of the procedures studied so far. As an analogy, consider the classical problem of searching for a given item in a table with n entries. In general, n comparisons are both necessary and sufficient for this task. If we wanted to perform k such searches, however, it is no longer clear that we need kn comparisons. Our table can be sorted once and for all at a cost of O(n log n) comparisons, after which binary search can be used. For sufficiently large k, this approach outperforms that of the k independent searches. In this chapter, we shall see that the philosophy subtending binary search can be fruitfully applied to string searching. Specifically, the text can be pre-processed once and for all in such a way that any query concerning whether or not a pattern occurs in the text can be answered in time proportional to the length of the pattern. It will also be possible to locate all the occurrences of the pattern in the text at an additional cost proportional to the total number of such occurrences. We call this type of search on-line, to refer to the fact that as soon as we finish reading the pattern we can decide whether or not it occurs in our text. As it turns out, the auxiliary structures used to achieve this goal are well suited to a host of other applications. There are several, essentially equivalent digital structures supporting efficient on-line string searching. Here, we base our discussion on a variant known as suffix tree. It is instructive to discuss first a simplified version of suffix trees, which we call expanded suffix tree.
APA, Harvard, Vancouver, ISO, and other styles
9

"Tries and Digital Search Trees." In Random Trees, 307–42. Vienna: Springer Vienna, 2009. http://dx.doi.org/10.1007/978-3-211-75357-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Weiland, Lydia, Felix Hanser, and Ansgar Scherp. "Requirements to a Search Engine for Semantic Multimedia Content." In Digital Multimedia, 720–34. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3822-6.ch036.

Full text
Abstract:
The authors investigate user requirements regarding the interface design for semantic multimedia search and retrieval based on a prototypical implementation of a search engine for multimedia content on the web. Thus, unlike existing image or video search engines, they are interested in true multimedia content combining different media assets into multimedia documents like PowerPoint presentations and Flash files. In a user study with 20 participants, the authors conducted a formative evaluation based on the think-aloud method and semi-structured interviews in order to obtain requirements to a future web search engine for multimedia content. The interviews are complemented by a paper-and-pencil questionnaire to obtain quantitative information. As a result, the authors elicit requirements to a web search engine for multimedia content. Among them, scalability and personalization of the presented information are identified as the main goals. Based on the requirements, they present mockups demonstrating the user interface of a future multimedia search and retrieval engine.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Digital search tree"

1

Shahmohammadi, Mohammad, and Hesham El Gamal. "Tree search for digital fingerprinting." In 2008 46th Annual Allerton Conference on Communication, Control, and Computing. IEEE, 2008. http://dx.doi.org/10.1109/allerton.2008.4797645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aalberg, Trond. "Branch Filtering of Tree-Structured Search Results." In 2019 ACM/IEEE Joint Conference on Digital Libraries (JCDL). IEEE, 2019. http://dx.doi.org/10.1109/jcdl.2019.00061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Drmota, Michael, and Wojciech Szpankowski. "(Un)Expected Behavior of Digital Search Tree Profile." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yamamoto, Masahito, Shu Kato, and Hiroyuki Iizuka. "Digital curling strategy based on game tree search." In 2015 IEEE Conference on Computational Intelligence and Games (CIG). IEEE, 2015. http://dx.doi.org/10.1109/cig.2015.7317931.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vosselman, George. "Use of tree search methods in digital photogrammetry." In Spatial Information from Digital Photogrammetry and Computer Vision: ISPRS Commission III Symposium, edited by Heinrich Ebner, Christian Heipke, and Konrad Eder. SPIE, 1994. http://dx.doi.org/10.1117/12.182906.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shatnawi, Mohammed, and Abdou Youssef. "Equivalence detection using parse-tree normalization for math search." In 2007 2nd International Conference on Digital Information Management. IEEE, 2007. http://dx.doi.org/10.1109/icdim.2007.4444297.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nuchter, Andreas, Kai Lingemann, and Joachim Hertzberg. "Cached k-d tree search for ICP algorithms." In Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007). IEEE, 2007. http://dx.doi.org/10.1109/3dim.2007.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hun, Kanal, and Brigitte Vallée. "Typical Depth of a Digital Search Tree built on a general source." In 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973204.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Surati, Shivangi, Devesh C. Jinwala, and Sanjay Garg. "A Peer-to-Peer multiway tree network with efficient range query search using multidimensional indexing." In 2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP). IEEE, 2014. http://dx.doi.org/10.1109/dictap.2014.6821646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wamiliana, Mustofa Usman, Dwi Sakethi, Restu Yuniarti, and Ahmad Cucus. "The hybrid of depth first search technique and Kruskal's algorithm for solving the multiperiod degree constrained minimum spanning tree problem." In 2015 4th International Conference on Interactive Digital Media (ICIDM). IEEE, 2015. http://dx.doi.org/10.1109/idm.2015.7516333.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Digital search tree' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography