نتایج جستجو برای: accelerating techniques

تعداد نتایج: 647320  

2017
H. Migallón V. Migallón J. Penadés

PageRank is a probability distribution used to represent the likelihood that a person randomly clicking on links will arrive at any particular page. Let G = [gij ]i,j=1 be a Web graph adjacency matrix with elements gij = 1 when there is a link from page j to page i, with i 6= j, and zero otherwise. From this matrix we can construct a transition matrix P = [pij ] n i,j=1 as follows: pij = gij cj...

Journal: :Artif. Intell. 2002
Yahia Lebbah Olivier Lhomme

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper1 we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domain...

1997
Karel Oliva

The paper describes several possibilities of using finite-state automata a~s means for speeding up the performance of a grammar-and-parsing-based (as opposed to pattern-matching-based) grammar-checker able to detect errors from a predefined set. The ideas contained have been successflfily implemented in a grammar-checker for Czech, a free-word-order language from the Slavic group. 1 Introductio...

2003
Karel Nechvíle Petr Tobola Jirí Sochor

Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategies. Since naive discontinuity meshing would produce a great amount of geometric computations, accelerating techniques are usually involved. In this paper, we present results obtained with help of k-discrete orientation ...

Journal: :Electr. Notes Theor. Comput. Sci. 2005
Christophe Darlot Alain Finkel Laurent Van Begin

Fast and TReX tools are designed to analyse systems with infinite state spaces. They both implement algorithms computing the set of reachable states of such systems. Since the state space may be infinite, acceleration techniques are used . In this paper, we study the differences between Fast and TReX acceleration techniques and show that although Fast remains in Presburger logics while accelera...

2011
Shyamalendu Kandar

Multimedia data are sensed by human. These types of data are delay intolerable but error tolerable to some extend. Two important parameters that degrade the quality of service (QoS) of multimedia services are Skew and Jitter. Achieving guaranteed Quality of Service (QoS) of multimedia service is a great research challenge. Different researchers proposed different techniques for removing jitteri...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید