نتایج جستجو برای: conclusions

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

1994

Although the incremental approach with spatiotemporal correlation provide roughly the same gain in accuracy as the global one, the running time is clearly much shorter. The ratio of running times when neglecting one or both of the spatial or temporal correlations is different for the global vs. incremental approach: for the global one, it is more expensive to consider temporal correlations, whi...

1994
Mark Hansen David Ittner Arnold Neumaier Daryl Pregibon

We have investigated a new methodology for studying recognition problems | rst we construct a realistic generative model, then we empirically study the resulting distributions to estimate tradeoos between computational requirements and the probability of error. Our experiments show that such simulations can provide a rich source of statistics to guide designers of classiiers, providing worst-ca...

1994
D Costal C Martin E Mayol J A Pastor C Quer M R Sancho J Sistac

[Ull89] Ullman, J.D. "Principles of database and knowledge-base systems", volumes 1 and 2. [Urp93] Urpí, T "El mètode dels esdeveniments interns per al càlcul de canvis en bases de dades deductives", Ph.D. thesis, Universitat Politècnica de Catalunya, Barcelona, 1993, (in catalan). implication mentioned before δProduct(p,n) → δAux2(p) and δAux2(p) → ¬ ∃s Supplier n (s,p) and, thus, Supplier n (...

1994

be able to obtain a gain in performance, essentially for free, by performing the post-processing step suggested in Claim 1. What we have proposed can therefore be added as the final step in existing schedulers. Of course, an exhaustive search procedure like the one proposed in [11] will certainly find the schedule directly. For an ordered transaction strategy, we use the transaction ordering su...

1998

In this work we implemented a parallel Radiosity rendering algorithm on a loosely-coupled cluster of PCs. The initial naive algorithm did not perform well, and in fact the computation time increased with the number of machines. We then applied a handful of tunings and optimization techniques which eventually made the algorithm execute eeciently, achieving speedups close to optimal. Previous rel...

1996
Mccall J Richards P Walters Boehm G Merritt M Char

The primary conclusions from the initial QARCC-1 experiment were: • QARCC-1 can help users, developers, customers, and other stakeholders to identify conflicts among their software quality requirements, and to identify additional potentially important quality requirements. In the experiment, QARCC-1 found both of the quality conflicts previously identified, plus five others considered significa...

1995

We have outlined a model of anaphora resolution which is founded on a dependency-based grammar model. This model accounts for sentence-level anaphora, with constraints adapted from GB, as well as text-level anaphora, with concepts close to Grosz-Sidner-style focus models. The associated text parser is based on the actor computation model. Its message passing mechanisms constitute the foundation...

1997

Finally, some preliminary results from simulations are reported. The experiments employed the Markov channel models as configured in 4.1 and the evaluation module of 3.2 with α = 15%, applied to a transmissions of the well-known Foreman sequence in QCIF format at 9.6 kb/s. The video codec was the H.263 TMN [3], i.e., without error correction and concealment techniques. Fig. 7 shows the above in...

1995
S Ercolani M Favalli M Damiani P Olivo B Ricco M Garey D Johnson P H Bardell W H Mcanney J Savir

as the level of inputs correlation changes, but also the values of total power consumption. For example, for duke2, the total power estimated under weakly correlated inputs was 3611.67 uW, while this value for strongly correlated inputs was 820.87 uW (there is a factor of 4 between the two). The same behavior has been observed for other circuits.To conclude, input pattern dependencies (in parti...

2000

This paper illustrated an application of Locally Weighted Projection Regression to a complex robot learning task. The O(n) update complexity of LWPR, together with its statistically sound dimensionality reduction and learning rules allowed a reliable and successful real-time implementation of the algorithm on an actual anthropomorphic robot. From the viewpoint of learning control, these results...

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

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