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

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

Journal: :Biophysical Journal 2013

Journal: :Theory and Practice of Logic Programming 2007

2014
David Nolden Hagen Soltau Daniel Povey Pegah Ghahremani Lidia Mangu Hermann Ney

In this work we present a novel word lattice filtering algorithm which removes redundancy from lattices. We use the filtering algorithm to analyze lattices obtained from dynamic network and transducer-based LVCSR decoders from several sites regarding size, coverage, and redundancy. We show that our filtering algorithm reduces the size of lattices by 30 to 90% without degrading the oracle word e...

2002
Graham D. Finlayson Steven D. Hordley Mark S. Drew

We attempt to recover a 2D chromaticity intrinsic variation of a single RGB image which is independent of lighting, without requiring any prior knowledge about the camera. The proposed algorithm aims to learn an invariant direction for projecting from 2D color space to the greyscale intrinsic image. We notice that along this direction, the entropy in the derived invariant image is minimized. Th...

Journal: :J. Comb. Theory, Ser. B 2007
Michael J. Pelsmajer Marcus Schaefer Daniel Stefankovic

An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and Tóth proved that a graph can always be redrawn such that its even edges are not involved in any intersections. We give a new, and significantly simpler, proof of a slightly stronger statement. We show two applications of this strengthened result: an easy proof of a the...

2016

Most dermatologists can perform cosmetic mole removals (this is not something to try at home with your trusty disposable razor). To take off an elevated mole, a dermatologist numbs the area with local anesthetic and then shaves off the raised section of the mole with a sterile scalpel. The healing process usually leaves a flat scar that's somewhat lighter than the rest of your skin. Sometimes t...

Journal: :SIAM J. Discrete Math. 2009
Michael J. Pelsmajer Marcus Schaefer Daniel Stefankovic

We show that cr(G) ≤ (2 iocr(G) 2 ) settling an open problem of Pach and Tóth [5,1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2.

Journal: :TPLP 2007
María Alpuente Santiago Escobar Salvador Lucas

The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the introduction of redundant arguments in the functions defined in the program. Redundancy of a parameter means that replacing it by any expression does not change t...

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

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