| 1 |
THE STRUCTURE OF FACTOR ORACLES ∗†
|
|
|
|
In: http://hal.inria.fr/docs/00/61/96/89/PDF/IJFCS07.pdf (2013)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Message-Passing Algorithms for Sparse Network Alignment
|
|
|
|
In: http://www.cs.purdue.edu/homes/dgleich/publications/Bayati 2013 - sparse belief propagation.pdf (2013)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
|
|
|
|
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) ; https://hal.archives-ouvertes.fr/hal-00913309 ; 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013, Kiel, Germany. pp.598--609, ⟨10.4230/LIPIcs.STACS.2013.598⟩ (2013)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Forty Years of Text Indexing
|
|
|
|
In: Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching ; CPM 2013 ; https://hal-upec-upem.archives-ouvertes.fr/hal-01246128 ; CPM 2013, Jun 2013, Bad Herrenalb, Germany. pp.1-10, ⟨10.1007/978-3-642-38905-4_1⟩ (2013)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
3D segmentation of the tongue in MRI: a minimally interactive model-based approach
|
|
|
|
In: https://bisicl.ece.ubc.ca/papers/CMBBE2014.pdf (2013)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Which granularity to bootstrap a multilingual method of document alignment: character N-grams or word N-grams?
|
|
|
|
In: EISSN: 1877-0428 ; Procedia - Social and Behavioral Sciences ; https://hal.archives-ouvertes.fr/hal-01074838 ; Procedia - Social and Behavioral Sciences, Elsevier, 2013, pp.473 - 481 (2013)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Parallel areas detection in multi-documents for multilingual alignment ; Détection de zones parallèles à l’intérieur de multi-documents pour l’alignement multilingue
|
|
|
|
In: 20ème conférence du Traitement Automatique du Langage Naturel 2013 (TALN 2013) ; https://hal.archives-ouvertes.fr/hal-01074950 ; 20ème conférence du Traitement Automatique du Langage Naturel 2013 (TALN 2013), Jun 2013, Sables d'Olonne, France (2013)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Context-aware access control and presentation of linked data ; Contrôle d'accès et présentation contextuelle pour le Web des données
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-00934617 ; Other [cs.OH]. Université Nice Sophia Antipolis, 2013. English. ⟨NNT : 2013NICE4099⟩ (2013)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Evaluation
|
|
|
|
In: http://demo.clab.cs.cmu.edu/sp2013-11731/slides/10.eval2.pdf (2013)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
|
|
Nguyen Thi, Thu Hien. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. : LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013
|
|
Abstract:
We describe a general framework for realistic analysis of sorting and searching algorithms, and we apply it to the average-case analysis of five basic algorithms: three sorting algorithms (QuickSort, InsertionSort, BubbleSort) and two selection algorithms (QuickMin and SelectionMin). Usually, the analysis deals with the mean number of key comparisons, but, here, we view keys as words produced by the same source, which are compared via their symbols in the lexicographic order. The "realistic" cost of the algorithm is now the total number of symbol comparisons performed by the algorithm, and, in this context, the average-case analysis aims to providee stimates for the mean number of symbol comparisons used by the algorithm. For sorting algorithms, and with respect to key comparisons, the average-case complexity of QuickSort is asymptotic to 2n log n, InsertionSort to n^2/4 and BubbleSort to n^2/2. With respect to symbol comparisons, we prove that their average-case complexity becomes Theta(n log^2n), Theta(n^2), Theta (n^2 log n). For selection algorithms, and with respect to key comparisons, the average-case complexity of QuickMin is asymptotic to 2n, of SelectionMin is n - 1. With respect to symbol comparisons, we prove that their average-case complexity remains Theta(n). In these five cases, we describe the dominant constants which exhibit the probabilistic behaviour of the source (namely, entropy, and various notions of coincidence) with respect to the algorithm.
|
|
Keyword:
Asymptotic e; Data processing Computer science; Information theory; Pattern matching; Permutations; Probabilistic analysis of algorithms; Rice formula; Sorting and searching algorithms
|
|
URN:
urn:nbn:de:0030-drops-39681
|
|
URL: https://drops.dagstuhl.de/opus/volltexte/2013/3968/
https://doi.org/10.4230/LIPIcs.STACS.2013.598
|
|
BASE
|
|
Hide details
|
|
|
| 11 |
Managing Uncertain Mediated Schema and Semantic Mappings Automatically in Dataspace Support Platforms
|
|
|
|
BASE
|
|
Show details
|
|
|
| 12 |
How the Thatcher illusion reveals evolutionary differences in the face processing of primates
|
|
|
|
BASE
|
|
Show details
|
|
|
| 13 |
The Efficacy of Fitting Cochlear Implants Based on Pitch Perception
|
|
Saleh, SMI. - : UCL (University College London), 2013
|
|
In: Doctoral thesis, UCL (University College London). (2013)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Gesture Recognition using Hidden Markov Models, Dynamic Time Warping, and Geometric Template Matching
|
|
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Gesture Recognition using Hidden Markov Models, Dynamic Time Warping, and Geometric Template Matching
|
|
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Resumption, Movement Effects, and a Matching Analysis of Ā-Dependencies
|
|
|
|
BASE
|
|
Show details
|
|
|
| 17 |
Demo: Approximate Semantic Matching in the COLLIDER Event Processing Engine
|
|
|
|
In: Kno.e.sis Publications (2013)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Sensitivity of Human Choice to Manipulations of Parameters of Positive and Negative Sound Reinforcement
|
|
|
|
In: All Graduate Theses and Dissertations (2013)
|
|
BASE
|
|
Show details
|
|
|
|
|
