Relevant bibliographies by topics / Random instance

Contents

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

Academic literature on the topic 'Random instance'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 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 'Random instance.'

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 "Random instance"

1

Carbonneau, Marc-André, Eric Granger, Alexandre J. Raymond, and Ghyslain Gagnon. "Robust multiple-instance learning ensembles using random subspace instance selection." Pattern Recognition 58 (October 2016): 83–99. http://dx.doi.org/10.1016/j.patcog.2016.03.035.

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

Bolton, Jeremy, Paul Gader, Hichem Frigui, and Pete Torrione. "Random set framework for multiple instance learning." Information Sciences 181, no. 11 (2011): 2061–70. http://dx.doi.org/10.1016/j.ins.2010.12.020.

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

Farhi, Edward, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, and Peter Shor. "Quantum adiabatic algorithms, small gaps, and different paths." Quantum Information and Computation 11, no. 3&4 (2011): 181–214. http://dx.doi.org/10.26421/qic11.3-4-1.

Full text
Abstract:
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then penalizing one of them with a single additional clause. We argue that by randomly modifying the beginning Hamiltonian, one obtains (with substantial probability) an adiabatic path that removes this difficulty. This suggests that the quantum adiabatic algorithm should in general be run on each instance with many different random paths leading to the problem Hami
APA, Harvard, Vancouver, ISO, and other styles
4

Singer, J., I. P. Gent, and A. Smaill. "Backbone Fragility and the Local Search Cost Peak." Journal of Artificial Intelligence Research 12 (May 1, 2000): 235–70. http://dx.doi.org/10.1613/jair.711.

Full text
Abstract:
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instances near the so-called `satisfiability threshold', but still shows a peak in search cost near the threshold and large variations in cost over different instances. We make a number of significant contributions to the analysis of WSat on high-cost random instances, using the recently-introduced concept of the backbone of a SAT instance. The backbone is the set of literals which are entailed by an instance. We find that t
APA, Harvard, Vancouver, ISO, and other styles
5

HUANG, Ye-jue, and He-rong ZHENG. "Online multiple instance boost random ferns for visual tracking." Journal of Computer Applications 32, no. 11 (2013): 3178–81. http://dx.doi.org/10.3724/sp.j.1087.2012.03178.

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

Yeon, Kyupil. "Stacking Based Ensemble with Instance Selection in Random KNN." Korean Data Analysis Society 22, no. 4 (2020): 1303–12. http://dx.doi.org/10.37727/jkdas.2020.22.4.1303.

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

Zheng, He Rong, and Ye Jue Huang. "Visual Tracking Using Combining Motion Constraint Model and Online Multiple Instance Boost Random Ferns." Applied Mechanics and Materials 263-266 (December 2012): 2385–92. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.2385.

Full text
Abstract:
Video object tracking is essential algorithm for computer vision applications. An object tracking algorithm using combining motion constraints model and online multiple instance boost random ferns is proposed, which use IIR filter to obtain online learning for random ferns, and the random ferns are selected by online multiple instance boosting to construct classifier of online multiple instance boost random ferns. To reduce effects of tracking error accumulation, object motion constraint model is constructed to constrain the results classified by online multiple instance boost random ferns to
APA, Harvard, Vancouver, ISO, and other styles
8

Assi, Ali, and Wajdi Dhifli. "Instance Matching in Knowledge Graphs through random walks and semantics." Future Generation Computer Systems 123 (October 2021): 73–84. http://dx.doi.org/10.1016/j.future.2021.04.015.

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

Chiu, David K. Y., Tao Xu, and Iker Gondra. "Random Graph-based Multiple Instance Learning for Structured IoT Smart City Applications." ACM Transactions on Internet Technology 21, no. 3 (2021): 1–17. http://dx.doi.org/10.1145/3448611.

Full text
Abstract:
Because of the complex activities involved in IoT networks of a smart city, an important question arises: What are the core activities of the networks as a whole and its basic information flow structure? Identifying and discovering core activities and information flow is a crucial step that can facilitate the analysis. This is the question we are addressing—that is, to identify the core services as a common core substructure despite the probabilistic nature and the diversity of its activities. If this common substructure can be discovered, a systemic analysis and planning can then be performed
APA, Harvard, Vancouver, ISO, and other styles
10

Burjons, Elisabet, Juraj Hromkovič, Rastislav Královič, Richard Královič, Xavier Muñoz, and Walter Unger. "Online Graph Coloring Against a Randomized Adversary." International Journal of Foundations of Computer Science 29, no. 04 (2018): 551–69. http://dx.doi.org/10.1142/s0129054118410058.

Full text
Abstract:
We consider an online model where an adversary constructs a set of [Formula: see text] instances [Formula: see text] instead of one single instance. The algorithm knows [Formula: see text] and the adversary will choose one instance from [Formula: see text] at random to present to the algorithm. We further focus on adversaries that construct sets of [Formula: see text]-chromatic instances. In this setting, we provide upper and lower bounds on the competitive ratio for the online graph coloring problem as a function of the parameters in this model. Both bounds are linear in [Formula: see text] a
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Random instance"

1

Wieler, Matthias [Verfasser], and Fred A. [Akademischer Betreuer] Hamprecht. "Multiple Instance Learning with Random Forests and Applications in Industrial Optical Inspection / Matthias Wieler ; Betreuer: Fred A. Hamprecht." Heidelberg : Universitätsbibliothek Heidelberg, 2014. http://d-nb.info/1180032144/34.

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

Namasivayam, Gayathri. "ON SIMPLE BUT HARD RANDOM INSTANCES OF PROPOSITIONAL THEORIES AND LOGIC PROGRAMS." UKnowledge, 2011. http://uknowledge.uky.edu/gradschool_diss/132.

Full text
Abstract:
In the last decade, Answer Set Programming (ASP) and Satisfiability (SAT) have been used to solve combinatorial search problems and practical applications in which they arise. In each of these formalisms, a tool called a solver is used to solve problems. A solver takes as input a specification of the problem – a logic program in the case of ASP, and a CNF theory for SAT – and produces as output a solution to the problem. Designing fast solvers is important for the success of this general-purpose approach to solving search problems. Classes of instances that pose challenges to solvers can help
APA, Harvard, Vancouver, ISO, and other styles
3

Gill, Jay S. (Jay Singh). "Simulations of error in quantum adiabatic computations of random 2-SAT instances." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36127.

Full text
Abstract:
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2006.<br>Includes bibliographical references (p. 45).<br>This thesis presents a series of simulations of quantum computations using the adiabatic algorithm. The goal is to explore the effect of error, using a perturbative approach that models 1-local errors to the Hamiltonian and estimates transition probabilities out of the ground state. The data show that a perturbation in the z-direction, parallel to the alignment of the computational basis, causes a greater error than one in the x-direction, and show with good confiden
APA, Harvard, Vancouver, ISO, and other styles
4

El, Sayah Mohamad. "Random Generation for the Performance Evaluation of Scheduling Algorithms." Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCD046.

Full text
Abstract:
L'objectif du travail à réaliser dans cette thèse consiste à mettre au pointdes techniques pour l'évaluation de la performance d'algorithmes dans lecadre de l'ordonnancement. Le travail consistera à proposer des protocoles expérimentaux précis pour évaluer des problèmes spécifiques d'ordonnancement en se restreignant par exemple à ceux qui partagent des instances similaires comme des graphes. Cela suppose d'une part d'analyser finement les problèmes considérés afin de définir ce que peuvent être des instances pertinentes. Ensuite, il faudra proposer des générateurs (aléatoires) d'instances (di
APA, Harvard, Vancouver, ISO, and other styles
5

Gatti, Lorenzo. "Analysis of the behaviour of the BSP algorithm on instances of random hypergraph bicoloring." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/15787/.

Full text
Abstract:
Nonostante la potenza e la velocità di calcolo di un moderno computer siano enormi ed in continuo sviluppo, esistono problemi particolari che richiedono tempi di computazione pari o addirittura superiori all'età dell'universo anche per i supercomputer più tecnologici. In questo contesto l'analisi delle transizioni di fase della meccanica statistica applicata ai sistemi disordinati è in grado di fornire uno scenario di studio completamente nuovo e meccaniche per lo sviluppo di algoritmi sempre più intelligenti.
APA, Harvard, Vancouver, ISO, and other styles
6

McBride, James 1973. "An evaluation of the performance of the quantum adiabatic algorithm on random instances of k-SAT." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29934.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 2002.<br>Includes bibliographical references (p. 91-95).<br>A quantum computational framework has been developed based on the adiabatic theorem. The theorem guarantees that a system with a time dependent Hamiltonian that is placed into its ground state will remain in its ground state provided that the Hamiltonian of the system varies slowly enough with time. This work investigates the performance of the quantum adiabatic algorithm on random instances of k-SAT. The performance of the algorithm is examined on subsets of k-
APA, Harvard, Vancouver, ISO, and other styles
7

Singer, J. B. "Why solutions can be hard to find : a featural theory of cost for a local search algorithm on random satisfiability instances." Thesis, University of Edinburgh, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.661976.

Full text
Abstract:
The local search algorithm WSAT is one of the most successful algorithms for solving the archetypal NP-complete problem of satisfiability (SAT). It is notably effective at solving RANDOM-3-SAT instances near the so-called "satisfiability threshold", which are thought to be universally hard. However, WSAT still shows a peak in search cost near the threshold and large variations in cost over different instances. Why are solutions to the threshold instances so hard to find using WSAT? What features characterise threshold instances which make them difficult for WSAT to solve? We make a number of s
APA, Harvard, Vancouver, ISO, and other styles
8

Cho, Jin-Hee. "Design, Implementation and Analysis of Wireless Ad Hoc Messenger." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/10058.

Full text
Abstract:
Popularity of mobile devices along with the presence of ad hoc networks requiring no infrastructure has contributed to recent advances in the field of mobile computing in ad hoc networks. Mobile ad hoc networks have been mostly utilized in military environments. The recent advances in ad hoc network technology now introduce a new class of applications. In this thesis, we design, implement and analyze a multi-hop ad hoc messenger application using Pocket PCs and Microsoft .Net Compact Framework. Pocket PCs communicate wirelessly with each other using the IEEE 802.11b technology without the use
APA, Harvard, Vancouver, ISO, and other styles
9

Fouemkeu, Norbert. "Modélisation de l’incertitude sur les trajectoires d’avions." Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10217/document.

Full text
Abstract:
Dans cette thèse, nous proposons des modèles probabilistes et statistiques d’analyse de données multidimensionnelles pour la prévision de l’incertitude sur les trajectoires d’aéronefs. En supposant que pendant le vol, chaque aéronef suit sa trajectoire 3D contenue dans son plan de vol déposé, nous avons utilisé l’ensemble des caractéristiques de l’environnement des vols comme variables indépendantes pour expliquer l’heure de passage des aéronefs sur les points de leur trajectoire de vol prévue. Ces caractéristiques sont : les conditions météorologiques et atmosphériques, les paramètres courant
APA, Harvard, Vancouver, ISO, and other styles
10

Merkle, Daniel, Martin Middendorf, and Nikolas Wieseke. "A parameter-adaptive dynamic programming approach for inferring cophylogenies." 2010. https://ul.qucosa.de/id/qucosa%3A32053.

Full text
Abstract:
Background Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phylogenies of both groups is often done by employing a set of possible types of events that happened during coevolution. Costs are assigned to the different types of events and a reconstruction of the common history with a minimal sum of event costs is sought. Results This paper introduces a new algorithm and a corresponding tool called CoRe-PA, that can be used to infer the common history of coevolutionary systems. The
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Random instance"

1

Schehr, Grégory, Alexander Altland, Yan V. Fyodorov, Neil O'Connell, and Leticia F. Cugliandolo, eds. Stochastic Processes and Random Matrices. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198797319.001.0001.

Full text
Abstract:
The field of stochastic processes and random matrix theory (RMT) has been a rapidly evolving subject during the past fifteen years where the continuous development and discovery of new tools, connections, and ideas have led to an avalanche of new results. These breakthroughs have been made possible thanks, to a large extent, to the recent development of various new techniques in RMT. Matrix models have been playing an important role in theoretical physics for a long time and they are currently also a very active domain of research in mathematics. An emblematic example of these recent advances
APA, Harvard, Vancouver, ISO, and other styles
2

Ramirez-Valles, Jesus. Social-class Origins and Trajectories. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252036446.003.0002.

Full text
Abstract:
This chapter examines the social-class origins of the Latino GBT activists, the compañeros. It proposes that social-class origins shaped some of these compañeros' life circumstances. That is, the social-class location of the families in which the activists were raised was one factor, if not the most significant, among several. For instance, some of the men who grew up in a poor or working-class environment began working early in their childhood or youth, did not go to college, and emigrated to the United States. As adults, some of them also experienced homelessness and unemployment. Only in ve
APA, Harvard, Vancouver, ISO, and other styles
3

Forey, Pamela, and Malcolm Saunders Publishing Ltd. Instant Guide to Wildflowers (Instant Guides (Random House)). Gramercy, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bianconi, Ginestra. Structural Correlations of Multiplex Networks. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198753919.003.0007.

Full text
Abstract:
Multiplex networks encode relevant information in their correlated structure, including interlayer degree correlation, link overlap, weight–topology correlations in weighted multiplex networks and activity of the nodes. Interlayer degree correlations among a pair of layers indicates for instance whether or not the hub nodes of one layer are also hub nodes in the other. Link overlap indicates that a finite fraction of nodes are connected in more than one layer. Weight–topology correlations of weighted complex networks reveal that the weight of the links is not random, but often correlated with
APA, Harvard, Vancouver, ISO, and other styles
5

Forey, Pamela, and Cecilia Fitzsimons. Instant Guide to Reptiles and Amphibians (Instant Guides (Random House)). Gramercy, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Instant Expert: Collecting American Folk Art (Instant Expert (Random House)). House of Collectibles, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Beckett, James. Instant Expert: Collecting Baseball and Other Sports Cards (Instant Expert (Random House)). House of Collectibles, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Huffaker, Ray, Marco Bittelli, and Rodolfo Rosa. Nonlinear Time Series Analysis with R. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198782933.001.0001.

Full text
Abstract:
In the process of data analysis, the investigator is often facing highly-volatile and random-appearing observed data. A vast body of literature shows that the assumption of underlying stochastic processes was not necessarily representing the nature of the processes under investigation and, when other tools were used, deterministic features emerged. Non Linear Time Series Analysis (NLTS) allows researchers to test whether observed volatility conceals systematic non linear behavior, and to rigorously characterize governing dynamics. Behavioral patterns detected by non linear time series analysis
APA, Harvard, Vancouver, ISO, and other styles
9

Valencia Rincón, Juan Carlos, Patrick Wehner, María Alejandra Beltrán López, et al. Contando colombianos: medición comercial, métricas de audiencias y biopolítica. Editorial Pontificia Universidad Javeriana, 2020. http://dx.doi.org/10.11144/javeriana.9789587815870.

Full text
Abstract:
La tiranía del rating se ha convertido en los últimos años en una expresión muy utilizada por diferentes actores de la industria de los medios de comunicación, que desconfían de la forma en la que las métricas miden el comportamiento de las audiencias. Los compradores, los periodistas, los actores y los productores ven cada vez más en estas mediciones una moneda de cambio que privilegia la cantidad sobre la calidad. Sin embargo, la investigación comercial de audiencias, y la manera en la que es implementada, ajustada, cuestionada, tolerada o acatada por las industrias mediáticas y publicitaria
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Random instance"

1

Wang, Dong, Jianmin Li, and Bo Zhang. "Multiple-Instance Learning Via Random Walk." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11871842_45.

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

Motoki, Mitsuo. "Random Instance Generation for MAX 3SAT." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44679-6_56.

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

Frank, Eibe, and Bernhard Pfahringer. "Propositionalisation of Multi-instance Data Using Random Forests." In Lecture Notes in Computer Science. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03680-9_37.

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

Deng, Yi, and Dongdai Lin. "Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability." In Advances in Cryptology - EUROCRYPT 2007. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72540-4_9.

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

Ruiz, Adria, Ognjen Rudovic, Xavier Binefa, and Maja Pantic. "Multi-Instance Dynamic Ordinal Random Fields for Weakly-Supervised Pain Intensity Estimation." In Computer Vision – ACCV 2016. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-54184-6_11.

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

Palczewska, Anna, and Urszula Markowska-Kaczmar. "Interpreting Neural Networks Prediction for a Single Instance via Random Forest Feature Contributions." In Computational Science – ICCS 2021. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77964-1_12.

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

Culus, Jean-François, and Sophie Toulouse. "How Far From a Worst Solution a Random Solution of a $$k\,$$CSP Instance Can Be?" In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94667-2_31.

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

Walrand, Jean. "Multiplexing: A." In Probability in Electrical Engineering and Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_3.

Full text
Abstract:
AbstractThis chapter explores the fluctuations of random variables away from their mean value. You flip a fair coin 100 times. How likely is it that you get 60 heads? Conversely, if you get 60 heads, how likely is it that the coin is fair? Such questions are fundamental in extracting information from data.In Sect. 3.1, we start by exploring the rate available to a user when a random number of them share a link, as illustrated in Sect. 3.1. Such calculations are central to network provisioning. The main analytical tool is the Central Limit Theorem explained in Sect. 3.2 where Gaussian random variables are also introduced and confidence intervals are defined. To share a common link, devices may be attached to a switch. For instance, the desktop computers in a building are typically connected to a switch that then sends the data to a common high-speed link. We explore the delays that packets face through the buffer of a switch in Sect. 3.3. The analysis uses a Markov chain model of the buffer. To share a wireless radio channel, devices use a multiple access protocol that regulates the transmissions. We study such schemes in Sect. 3.4. We use probabilistic models of the protocols.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Peng, and Yong Gao. "Super Solutions of Random Instances of Satisfiability." In Frontiers in Algorithmics. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19647-3_29.

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

Mougenot, Alix, Alexis Darrasse, Xavier Blanc, and Michèle Soria. "Uniform Random Generation of Huge Metamodel Instances." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02674-4_10.

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

Conference papers on the topic "Random instance"

1

Xu, Tao, David Chiu, and Iker Gondra. "Common Random Subgraph Modeling Using Multiple Instance Learning." In 2018 24th International Conference on Pattern Recognition (ICPR). IEEE, 2018. http://dx.doi.org/10.1109/icpr.2018.8545389.

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

Straehle, Christoph, Melih Kandemir, Ullrich Koethe, and Fred A. Hamprecht. "Multiple Instance Learning with Response-Optimized Random Forests." In 2014 22nd International Conference on Pattern Recognition (ICPR). IEEE, 2014. http://dx.doi.org/10.1109/icpr.2014.647.

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

Zhang, Le, Ye Ren, and P. N. Suganthan. "Instance based random forest with rotated feature space." In 2013 IEEE Symposium on Computational Intelligence and Ensemble Learning (CIEL). IEEE, 2013. http://dx.doi.org/10.1109/ciel.2013.6613137.

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

Carbonneau, Marc-Andre, Eric Granger, and Ghyslain Gagnon. "Witness identification in multiple instance learning using random subspaces." In 2016 23rd International Conference on Pattern Recognition (ICPR). IEEE, 2016. http://dx.doi.org/10.1109/icpr.2016.7900199.

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

Ma, Liyao, Bin Sun, and Chunyan Han. "Training Instance Random Sampling Based Evidential Classification Forest Algorithms." In 2018 International Conference on Information Fusion (FUSION). IEEE, 2018. http://dx.doi.org/10.23919/icif.2018.8455427.

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

Ferreira, Ednaldo J., Alexandre C. B. Delbem, Roseli A. Francelin Romero, and Osvaldo N. Oliveira. "Random subspaces of the instance and principal component spaces for ensembles." In 2009 International Joint Conference on Neural Networks (IJCNN 2009 - Atlanta). IEEE, 2009. http://dx.doi.org/10.1109/ijcnn.2009.5178712.

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

Vineet, Vibhav, Jonathan Warrell, Lubor Ladicky, and Philip Torr. "Human Instance Segmentation from Video using Detector-based Conditional Random Fields." In British Machine Vision Conference 2011. British Machine Vision Association, 2011. http://dx.doi.org/10.5244/c.25.80.

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

Bolton, Jeremy, and Paul Gader. "Cross Entropy Optimization of the Random Set Framework for Multiple Instance Learning." In 2010 20th International Conference on Pattern Recognition (ICPR). IEEE, 2010. http://dx.doi.org/10.1109/icpr.2010.1114.

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

Javid, Alireza M., Arun Venkitaraman, Mikael Skoglund, and Saikat Chatterjee. "High-Dimensional Neural Feature Using Rectified Linear Unit And Random Matrix Instance." In ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020. http://dx.doi.org/10.1109/icassp40776.2020.9054736.

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

Gao, Yong. "A Random Model for Argumentation Framework: Phase Transitions, Empirical Hardness, and Heuristics." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/71.

Full text
Abstract:
We propose and study, theoretically and empirically, a new random model for the abstract argumentation framework (AF). Our model overcomes some intrinsic difficulties of the only random model of directed graphs in the literature that is relevant to AFs, and makes it possible to study the typical-case complexity of AF instances in terms of threshold behaviours and phase transitions. We proved that the probability for a random AF instance to have a stable/preferred extension goes through a sudden change (from 1 to 0) at the threshold of the parameters of the new model D(n, p, q), satisfying the
APA, Harvard, Vancouver, ISO, and other styles
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