Log in

Relevant bibliographies by topics / Weighted sequences

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Weighted sequences'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 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 'Weighted sequences.'

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 "Weighted sequences"

1

Garn, Bernhard, and Dimitris E. Simos. "Weighted t-way Sequences." Electronic Notes in Discrete Mathematics 70 (December 2018): 43–48. http://dx.doi.org/10.1016/j.endm.2018.11.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mathew, Jill K., and Sunil Mathew. "Special sequences in weighted graphs." International Journal of Computing Science and Mathematics 8, no. 4 (2017): 313. http://dx.doi.org/10.1504/ijcsm.2017.085851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mathew, Jill K., and Sunil Mathew. "Special sequences in weighted graphs." International Journal of Computing Science and Mathematics 8, no. 4 (2017): 313. http://dx.doi.org/10.1504/ijcsm.2017.10006755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Totura, Ümit, and İbrahim Çanak. "On regularly weighted generated sequences." Filomat 31, no. 7 (2017): 2167–73. http://dx.doi.org/10.2298/fil1707167t.

Full text

Abstract:

We introduce a new concept which is called a regularly weighted generated sequence for sequences of real numbers. Moreover, we obtain some Tauberian conditions in terms of regularly weighted generated sequences for the power series method of summability, and generalize some classical Tauberian theorems given by Tietz [Acta Sci. Math. 54 (3-4) 355-365 (1990)].

APA, Harvard, Vancouver, ISO, and other styles

5

Corcino, R. B., K. J. M. Gonzales, M. J. C. Loquias, and E. L. Tan. "Dually weighted Stirling-type sequences." European Journal of Combinatorics 43 (January 2015): 55–67. http://dx.doi.org/10.1016/j.ejc.2014.06.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Pessoa, Bruno Jefferson de S., Daniel Aloise, and Lucidio A. F. Cabral. "The Weighted Fair Sequences Problem." Computers & Operations Research 91 (March 2018): 121–31. http://dx.doi.org/10.1016/j.cor.2017.11.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Das Adhikari, Sukumar, David J. Grynkiewicz, and Zhi-Wei Sun. "On weighted zero-sum sequences." Advances in Applied Mathematics 48, no. 3 (March 2012): 506–27. http://dx.doi.org/10.1016/j.aam.2011.11.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nakazi, Takahiko. "Weighted interpolation of weighted ℓ^p sequences and Carleson inequality." Journal of Mathematical Inequalities, no. 2 (2012): 161–66. http://dx.doi.org/10.7153/jmi-06-16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Strand, Robin. "Weighted distances based on neighbourhood sequences." Pattern Recognition Letters 28, no. 15 (November 2007): 2029–36. http://dx.doi.org/10.1016/j.patrec.2007.05.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Barton, Carl, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, and Jakub Radoszewski. "Indexing weighted sequences: Neat and efficient." Information and Computation 270 (February 2020): 104462. http://dx.doi.org/10.1016/j.ic.2019.104462.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Weighted sequences"

1

Christodoulakis, Emmanouil. "Regularities on fixed and weighted sequences." Thesis, King's College London (University of London), 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.420363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Biaggi, Andrea. "Combining the normal hedge algorithm with weighted trees for predicting binary sequences." Diss., [La Jolla] : University of California, San Diego, 2010. http://wwwlib.umi.com/cr/ucsd/fullcit?p1474775.

Full text

Abstract:

Thesis (M.S.)--University of California, San Diego, 2010.
Title from first page of PDF file (viewed April 14, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 30).

APA, Harvard, Vancouver, ISO, and other styles

3

Furuta, Akihiro. "Comparison of monopolar and bipolar diffusion weighted imaging sequences for detection of small hepatic metastases." Kyoto University, 2015. http://hdl.handle.net/2433/195942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wu, Changshun. "Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0717.

Full text

Abstract:

L'un des problèmes fondamentaux de test pour les systèmes à événements discrets (SEDs) est l'identification d'un état final, c'est-à-dire, étant donné un système dont l'état courant est inconnu, trouver une séquence d'événements d'entrée pouvant le conduire à un état connu. Les séquences de synchronisation (SS), sans information de sortie, sont une solution classique à ce problème. Dans cette thèse, nous étudions la détermination des SS pour des systèmes modélisés par des réseaux de Petri synchronisés (SynPN) non bornés, une classe de réseaux de Petri avec des entrées. Dans la première partie de cette thèse, nous développons deux méthodes: 1) construction d'une représentation finie, appelée improved modified coverability graph (IMCG), pour d'écrire exactement l'espace d'états infini d'un 1-place-unbounded SynPN; 2) conversion d'un 1-place-unbounded SynPN en un automate pondéré (WA) fini et sauf équivalent. Les deux graphes sont ainsi potentiellement des outils puissants pour déterminer les SS pour une telle sous-classe de réseaux de Petri. Dans la seconde partie de cette thèse, nous développons des algorithmes de calcul pour deux problèmes de synchronisation de localisation dans le cas où l'IMCG ou le WA sont déterministes : synchronisation sur un seul nœud et synchronisation sur un sous-ensemble de nœuds de ces deux graphes. L'avantage de ces algorithmes de calcul est de réduire le calcul sur les graphes globaux (IMCG ou WA) à celui du plus petit sous-graphe: la composante fortement connectée ergodique peut réduire l'effort de calcul mais peut également être appliquée lorsque le IMCG ou le WA équivalent déterministes ne sont pas fortement connexes
One of the fundamental testing problems for discrete event systems (DESs) is the identification of a final state, i.e., given a system whose current state is unknown, find an input sequence that can drive it to a known state. Synchronizing sequences (SSs), without output information, are one conventional solution to this problem. In this thesis, we address the computation of SSs for systems modeled by unbounded synchronized Petri nets (SynPNs), a class of Petri nets with inputs. In the first part of this thesis, we utilize two methods: 1) construct a finite representation, called improved modified coverability graph (IMCG), to exactly describe the infinite state space of a 1-place-unbounded SynPN; 2) convert a 1-place-unbounded SynPN into an equivalent finite location weighted automaton (WA) with safety conditions. Both graphs are thus, potentially, useful tools to compute SSs for such subclass of nets. In the second part of this thesis, we develop computation algorithms for two location synchronization problems in the case either the IMCG or the WA is deterministic: synchronization into a single node and synchronization into a subset of nodes of these two graphs. The advantage of these computation algorithms consists in reducing the computation on the global graphs (IMCGs or WAs) to the one on the smaller subgraph: the ergodic strongly connected component (SCC), which can reduce the computational effort and furthermore can also be applied when the converted deterministic IMCG or WA is not strongly connected

APA, Harvard, Vancouver, ISO, and other styles

5

Temirkhanova, Ainur. "Estimates for Discrete Hardy-type Operators in Weighted Sequence Spaces." Doctoral thesis, Luleå tekniska universitet, Matematiska vetenskaper, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-18222.

Full text

Abstract:

This PhD thesis consists of an introduction and eight papers, which deal with questions of the validity of some new discrete Hardy type inequalities in weighted spaces of sequences and on the cone of non-negative monotone sequences, and their applications. In the introduction we give an overview of the area that serves as a frame for the rest of the thesis. In particular, a short description of the development of Hardy type inequalities is given. In Paper 1 we find necessary and sufficient conditions on weighted sequences $\omega_i$, $i=1, 2,...,n-1$, $u$ and $v$, for which the operator $$ (S_{n}f)_i=\sum\limits_{k_1=1}^i\omega_{1,k_1}\cdots\sum\limits_{k_{n-1}=1}^{k_{n-2}} \omega_{n-1,k_{n-1}}\sum\limits_{j=1}^{k_{n-1}}f_j,~~ i\geq 1,~~~~~(1) $$ is bounded from $l_{p,v}$ to $l_{q,u}$ for $1<p\leq q<\infty$. In Paper 2 we prove a new discrete Hardy-type inequality $$ \|Af\|_{q,u}\leq C\|f\|_{p,v},~~~~1<p\leq q<\infty,~~~~~~~~~~~(2) $$ where the matrix operator $A$ is defined by $\left(Af\right)_i:=\sum\limits_{j=1}^ia_{i,j}f_j,$ ~$a_{i, j}\geq 0$, where the entries $a_{i, j}$ satisfy less restrictive additional conditions than studied before. Moreover, we study the problem of compactness for the operator $A$, and also the dual result is stated, proved and discussed. In Paper 3 we derive the necessary and sufficient conditions for inequality (2) to hold for the case $1<q<p<\infty$. In Papers 4 and 5 we obtain criteria for the validity of the inequality (2) for slightly more general classes of matrix operators $A$ defined by $\left(Af\right)_j:=\sum\limits_{i=j}^\infty a_{i,j}f_i,$ ~$a_{i, j}\geq 0$, when $1<p, q<\infty$. Moreover, we study the problem of compactness for the operator $A$ for the case $1<p\leq q<\infty$, also the dual result is established and here we also give some applications of the main results. In Paper 6 we state boundedness for the operator of multiple summation with weights (1) in weighted sequence spaces for the case $1<q<p<\infty$. Paper 7 deals with new Hardy-type inequalities restricted to the cones of monotone sequences. The case $1<q<p<\infty$ is considered. Also some applications related to H\"{o}lder's summation method are pointed out. In Paper 8 we obtain necessary and sufficient conditions for which three-weighted Hardy type inequalities hold.

Godkänd; 2015; 20151021 (aintem); Nedanstående person kommer att disputera för avläggande av teknologie doktorsexamen. Namn: Ainur Temirkhanova Ämne: Matematik/Mathematics Avhandling: Estimates for Discrete Hardy-type Operators in Weighted Sequence Spaces Opponent: Professor Mikhail Goldman, Dept of Nonlinear Analysis and Optimization, Peoples’Friendship University of Russia, Moscow, Russia. Ordförande: Professor Peter Wall, Avd för matematiska vetenskaper, Institutionen för teknikvetenskap och matematik, Luleå tekniska universitet, Luleå. Tid: Tisdag 8 december kl 10.00 Plats: E246, Luleå tekniska universitet

APA, Harvard, Vancouver, ISO, and other styles

6

Faulkner, Sean (Sean Anthony) Carleton University Dissertation Engineering Electrical. "Determination of maximal-length sequences by weight distribution analysis." Ottawa, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Denev, Alexander. "Digital Distance Functions Defined by Sequence of Weights." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-162025.

Full text

Abstract:

In this paper, digital distance functions using sequences of weights are studied and used to approximate the Euclidian distance. Sequences of weights that guarantee a low maximum absolute error for path lengths of up to 10000 are calculated. A necessary condition and a sufficient condition for metricity of this kind of distance function are established.

APA, Harvard, Vancouver, ISO, and other styles

8

Bodily, Paul Mark. "Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3793.

Full text

Abstract:

Virtually all genome assemblers to date are designed for use with data from haploid or homozygous diploid genomes. Their use on heterozygous genomic datasets generally results in highly-fragmented, error-prone assemblies, owing to the violation of assumptions during both the contigging and scaffolding phases. Of the two phases, scaffolding is more particularly impacted and algorithms to facilitate the scaffolding of heterozygous data are lacking. We present a stand-alone scaffolding algorithm, ScaffoldScaffolder, designed specifically for scaffolding diploid genomes. A fundamental step in the scaffolding phase is the assignment of sequence orientations to contigs within scaffolds. Deciding such an assignment in the presence of ambiguous evidence is what is termed the contig orientation problem. We define this problem using bidirected graph theory and show that it is equivalent to the weighted MAX-CUT problem. We present a greedy heuristic solution which we comparatively assess with other solutions to the contig orientation problem, including an advanced MAX-CUT heuristic. We illustrate how a solution to this problem provides a simple means of simultaneously identifying inverted haplotypes, which are uniquely found in diploid genomes and which have been shown to be involved in the genetic mechanisms of several diseases. Ultimately our findings show that due to the inherent biases in the underlying biological model, a greedy heuristic algorithm performs very well in practice, retaining a higher total percent of edge weight than a branch-and-bound semidefinite programming heuristic. This application exemplifies how existing graph theory algorithms can be applied in the development of new algorithms for more accurate assembly of heterozygous diploid genomes.

APA, Harvard, Vancouver, ISO, and other styles

9

黃耀進 and Yuejin Huang. "A multiple access interference rejection technique using weighted despreading functions for direct-sequence code division multipleaccess communications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31237071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Huang, Yuejin. "A multiple access interference rejection technique using weighted despreading functions for direct-sequence code division multiple access communications /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19627543.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Weighted sequences"

1

Cruise, Jorge. The 12-second sequence: Shrink your waist in 2 weeks! New York: Crown Publishers, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cruise, Jorge. The 12-second sequence: How to burn 20% more calories every day. New York: Crown Publishers, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Trends in number theory: Fifth Spanish meeting on number theory, July 8-12, 2013, Universidad de Sevilla, Sevilla, Spain. Providence, Rhode Island: American Mathematical Society, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Das, Raj, Susan Heenan, and Uday Patel. Magnetic resonance imaging in urology. Edited by Michael Weston. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780199659579.003.0134.

Full text

Abstract:

Magnetic resonance imaging is essential for urological imaging. It offers excellent soft tissue contrast and resolution, allowing manipulation of tissue contrast with different image weighting and sequences. The multiplanar aspect of MRI allows image acquisition in different planes and degrees of obliquity to best exhibit pathology. The basic physics of MRI is explored initially with explanation of image weighting, sequences, and diffusion-weighted imaging. The chapter is then divided into renal, bladder, and prostate MRI imaging. The paragraphs on renal MRI outline renal mass analysis and include characterization and assessment of cystic and fat-containing lesions. Staging of renal carcinoma with MRI is also discussed, along with its advantages compared with CT staging. Throughout the text, the key diagnostic MRI features with each disease and organ, and the pitfalls and caveats of MRI imaging are emphasized.

APA, Harvard, Vancouver, ISO, and other styles

5

Sequence spaces with exponent weights, realizations of Colombeau type algebras. Warszawa: Institute of Mathematics, Polish Academy of Sciences, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cruise, Jorge. The 12 Second Sequence: Shrink Your Waist in 2 Weeks. Crown, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cruise, Jorge. The 12 Second Sequence: Shrink Your Waist in 2 Weeks. RH Audio, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cruise, Jorge. The 12 Second Sequence Journal: Shrink Your Waist in 2 Weeks! Potter Style, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Boehm, Heinrich, and Y. Raja Rampersaud. Treatment: spinal surgery. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780198734444.003.0023.

Full text

Abstract:

Despite remarkable progress in understanding the pathological processes and alleviating symptoms by TNFα‎ blocking medication, the mechanism that converts flexible tissue into bone still cannot be completely prevented or reversed. In axial spondyloarthritis, components of motion segments, such as zygoapophyseal joints, intervertebral discs, and spinal ligaments, can ossify in varying sequence, extent, and location between the ilium and occiput. Throughout this process, the spinal column is vulnerable to kyphotic deformity due to gravity, body weight, muscle action, and life’s flexion-based activities. Areas with low fusion tendency, such as atlanto-axial joints, and post-traumatically weakened spots of formerly ankylosed vertebral block (Andersson’s lesion) can endanger the spinal cord by instability, dislocation, and compression, from what is typically minor trauma or simple repetitive, but otherwise normal, stresses. Once functionally significant deformity or presence of instability and associated symptoms are established, conservative treatment options are lacking and surgical consideration is required.

APA, Harvard, Vancouver, ISO, and other styles

10

Servin, Frédérique S., and Valérie Billard. Anaesthesia for the obese patient. Edited by Philip M. Hopkins. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780199642045.003.0087.

Full text

Abstract:

Obesity is becoming an epidemic health problem, and the number of surgical patients with a body mass index of more than 50 kg m−2 requiring anaesthesia is increasing. Obesity is associated with physiopathological changes such as metabolic syndrome, cardiovascular disorders, or sleep apnoea syndrome, most of which improve with weight loss. Regarding pharmacokinetics, volumes of distribution are increased for both lipophilic and hydrophilic drugs. Consequently, doses should be adjusted to total body weight (propofol for maintenance, succinylcholine, vancomycin), or lean body mass (remifentanil, non-depolarizing neuromuscular blocking agent). For all drugs, titration based on monitoring of effects is recommended. To minimize recovery delays, drugs with a rapid offset of action such as remifentanil and desflurane are preferable. Poor tolerance to apnoea with early hypoxaemia and atelectasis warrant rapid sequence induction and protective ventilation. Careful positioning will prevent pressure injuries and minimize rhabdomyolysis which are frequent. Because of an increased risk of pulmonary embolism, multimodal prevention is mandatory. Regional anaesthesia, albeit technically difficult, is beneficial in obese patients to treat postoperative pain and improve rehabilitation. Maximizing the safety of anaesthesia for morbidly obese patients requires a good knowledge of the physiopathology of obesity and great attention to detail in planning and executing anaesthetic management. Even in elective surgery, many cases can be technical challenges and only a step-by-step approach to the avoidance of potential adverse events will result in the optimal outcome.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Weighted sequences"

1

Cohen, Gérard D., Simon N. Litsyn, and H. F. Mattson. "Binary Perfect Weighted Coverings (PWC)." In Sequences II, 36–51. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-9323-8_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ramaré, Olivier. "Some weighted sequences." In Arithmetical Aspects of the Large Sieve Inequality, 121–27. Gurgaon: Hindustan Book Agency, 2009. http://dx.doi.org/10.1007/978-93-86279-40-8_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Iliopoulos, Costas S., Katerina Perdikuri, Evangelos Theodoridis, Athanasios Tsakalidis, and Kostas Tsichlas. "Motif Extraction from Weighted Sequences." In String Processing and Information Retrieval, 286–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30213-1_41.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Amir, Amihood, Costas Iliopoulos, Oren Kapah, and Ely Porat. "Approximate Matching in Weighted Sequences." In Combinatorial Pattern Matching, 365–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780441_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Christodoulakis, Manolis, and Costas S. Iliopoulos. "Recent Advances in Weighted DNA Sequences." In Algorithms in Computational Molecular Biology, 143–69. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2010. http://dx.doi.org/10.1002/9780470892107.ch8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Hui, Qing Guo, and Costas S. Iliopoulos. "Varieties of Regularities in Weighted Sequences." In Algorithmic Aspects in Information and Management, 271–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14355-7_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Solé, Patrick, and Dmitrii Zinoviev. "Weighted Degree Trace Codes for PAPR Reduction." In Sequences and Their Applications - SETA 2004, 406–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11423461_31.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kritzer, Peter, and Friedrich Pillichshammer. "The Weighted Dyadic Diaphony of Digital Sequences." In Monte Carlo and Quasi-Monte Carlo Methods 2006, 549–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-74496-2_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Hui, Qing Guo, and Costas S. Iliopoulos. "Locating Tandem Repeats in Weighted Biological Sequences." In Communications in Computer and Information Science, 118–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31837-5_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Arici, Francesca. "Gysin Exact Sequences for Quantum Weighted Lens Spaces." In MATRIX Book Series, 251–62. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72299-3_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Weighted sequences"

1

Solous, S. "Weighted sequences for HF FMCW sounding." In 7th International Conference on High Frequency Radio Systems and Techniques. IEE, 1997. http://dx.doi.org/10.1049/cp:19970833.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Weng, Binwei, Tuncer C. Aysal, and Kenneth E. Barner. "Polynomial Weighted Median Predictors for Image Sequences." In 2006 International Conference on Image Processing. IEEE, 2006. http://dx.doi.org/10.1109/icip.2006.312938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lee, Inbok. "A simple pattern matching algorithm for weighted sequences." In the 2012 ACM Research in Applied Computation Symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2401603.2401616.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chakraborty, Mithun, Ulrike Schmidt-Kraepelin, and Warut Suksompong. "Picking Sequences and Monotonicity in Weighted Fair Division." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/12.

Full text

Abstract:

We study the problem of fairly allocating indivisible items to agents with different entitlements, which captures, for example, the distribution of ministries among political parties in a coalition government. Our focus is on picking sequences derived from common apportionment methods, including five traditional divisor methods and the quota method. We paint a complete picture of these methods in relation to known envy-freeness and proportionality relaxations for indivisible items as well as monotonicity properties with respect to the resource, population, and weights. In addition, we provide characterizations of picking sequences satisfying each of the fairness notions, and show that the well-studied maximum Nash welfare solution fails resource- and population-monotonicity even in the unweighted setting. Our results serve as an argument in favor of using picking sequences in weighted fair division problems.

APA, Harvard, Vancouver, ISO, and other styles

5

"Handling Weighted Sequences Employing Inverted Files and Suffix Trees." In International Conference on Web Information Systems and Technologies. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004788502310238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Malkowsky, Eberhard, and Faruk Özger. "Compact operators on spaces of sequences of weighted means." In FIRST INTERNATIONAL CONFERENCE ON ANALYSIS AND APPLIED MATHEMATICS: ICAAM 2012. AIP, 2012. http://dx.doi.org/10.1063/1.4747669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jamil, Momin, Hans-Jiirgen Zepernick, and Mats I. Pettersson. "Cross-ambiguity function of weighted pulse trains with Oppermann sequences." In 2009 6th International Symposium on Wireless Communication Systems (ISWCS 2009). IEEE, 2009. http://dx.doi.org/10.1109/iswcs.2009.5285220.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Saeidi, Mahmoud, and Ali Nazemipour. "Impulse Noise Reduction in Image Sequences using an Adaptive Weighted Filtering." In Signal Processing, Pattern Recognition, and Applications / Computer Graphics and Imaging. Calgary,AB,Canada: ACTAPRESS, 2011. http://dx.doi.org/10.2316/p.2011.721-067.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Forbes, F., S. Doyle, D. Garcia-Lorenzo, C. Barillot, and M. Dojat. "Adaptive weighted fusion of multiple MR sequences for brain lesion segmentation." In 2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro. IEEE, 2010. http://dx.doi.org/10.1109/isbi.2010.5490413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jamil, Momin, Hans-Jurgen Zepernick, and Mats I. Pettersson. "Properties of ambiguity functions for weighted pulse trains with Oppermann sequences." In 2009 3rd International Conference on Signal Processing and Communication Systems (ICSPCS 2009). IEEE, 2009. http://dx.doi.org/10.1109/icspcs.2009.5306402.

Full text

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!