Asymptote Finding Vertical
  Home FAQ Contact Sign in
 
 Advanced search
MATCHING GROUPS



more...
POPULAR GROUPS

more...
found 22 articles for 0.765 sec
I'm writing a program to sketch curves, be they simple single-valued functions or implicit relations between variables (e.g., x^2/6 + y^2/9 = 1). One feature I'd especially like to include is the automatic detection of vertical asymptotes. If my program knows which input values are undefined, than it can avoid the ugly mistakes most plotting programs make, like joining the two halves of the reciprocal     

Group: comp.graphics.algorithms · Group Profile · Search for Asymptote Finding Vertical in comp.graphics.algorithms
Author: Robert Blake
Date: Jul 9, 2008 13:06

A new Algorithms and Complexity Group event has been scheduled: On the Complexity of Finding an Unknown Cut via Vertex Queries We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, we make a few assumptions which allow us to obtain an algorithm with the worst case query
Show full article (1.51Kb)
A new Computer Science event has been scheduled: On the Complexity of Finding an Unknown Cut via Vertex Queries We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, we make a few assumptions which allow us to obtain an algorithm with the worst case query complexity     

Group: uw.talks · Group Profile · Search for Asymptote Finding Vertical in uw.talks
Author: wlrush
Date: May 3, 2007 05:34

On Apr 8, 10:06 pm, maya <maya16_...@hotmail.com> wrote: Find the absolute maximum and absolute minimum values on f on the given interval. 1. f(t) = t + cot (t/2) , [0,8] 2. little 3 on top of the square root of t (8 - t) , [0,8] I am very lost because these two problems are killing me. Can anyone help me with these In general (as stated), you must differentiate the function
Show full article (1.02Kb)
Right, but if you instead try it with median filter you obtain a draft inacceptable result. Well, I can give it a try anyway... "Kaba" <none@here.com> ha scritto nel messaggio news:MPG.218efee7dd1513dd989945@news.cc.tut.fi... >> yeah, I was trying to find a way to write a filter as separable but it >> looks >> like it's impossible to make it that way. >> Thanks. > > Ok, this explains     

Group: uw.talks · Group Profile · Search for Asymptote Finding Vertical in uw.talks
Author: wlrush
Date: Apr 27, 2007 09:38

> yeah, I was trying to find a way to write a filter as separable but it looks like it's impossible to make it that way. Thanks. Ok, this explains your question:) Doing two 1d filter passes instead of one 2d is considerably (most importantly asymptotically) faster. Unfortunately not all filters are separable. What you can do however is to approximate the filter with a separable one
Show full article (1.01Kb)
> You cannot obtain an O(n log n) upper bound in general. Just for > simplicity of the argument, I refer to lines, but you can truncate > them to segments and obtain the same results. Consider 2n lines. > n of these are vertical, passing through (i,0) for 1 <= i <= n. n of > these are horizontal, passing through (0,j) for 1 <= j <= n. There > are n^2 intersection points, so it is not possible     

Group: alt.math.undergrad · Group Profile · Search for Asymptote Finding Vertical in alt.math.undergrad
Author: Mr. R
Date: Apr 14, 2008 05:19

Michael S. Morris wrote: [...] I said: I can perfectly well understand telling a class at an introductory level to simply memorize the book's list of 7 modes for the test. I cannot understand having so little skepticism in one's mind as to take something like that as "real", however.) Marty: You needn't trivialize it excessively. The error might have
Show full article (1.13Kb) · Show article thread
Monday, the 4th of June, 2007 I said: But, I mean he lacks reading comprehension and rational coherence. And that---not the chip on his shoulder about funadmentalists or whatever it is---is something I *do* figure has always been the case and in spite of which he has probably gotten credentialed by the system. Netti: I would have to disagree     

Group: comp.graphics.algorithms · Group Profile · Search for Asymptote Finding Vertical in comp.graphics.algorithms
Author: 4N
Date: Oct 29, 2007 01:09

Saturday, the 2nd of June, 2007 [snipping as much as I can] Marty: he *couldn't* have been *any* thing like this back in the day. Umm, yes and no. The persecution complex, no. Meaning I agree that it is impossible that once upon a time Mark could have considered himself to have been mistreated or "picked on" by what little if anything happened in
Show full article (0.99Kb) · Show article thread
    

Group: comp.graphics.algorithms · Group Profile · Search for Asymptote Finding Vertical in comp.graphics.algorithms
Author: Kaba
Date: Oct 28, 2007 11:18

Show full article (0.73Kb) · Show article thread
    

Group: comp.graphics.algorithms · Group Profile · Search for Asymptote Finding Vertical in comp.graphics.algorithms
Author: Kaba
Date: Oct 25, 2007 01:32

Show full article (1.58Kb) · Show article thread
    

Group: misc.education.homeschool.christian · Group Profile · Search for Asymptote Finding Vertical in misc.education.homeschool.christian
Author: Marty Carts
Date: Jun 6, 2007 22:02

Show full article (23.21Kb)
    

Group: misc.education.homeschool.christian · Group Profile · Search for Asymptote Finding Vertical in misc.education.homeschool.christian
Author: Michael S. Morris
Date: Jun 4, 2007 07:25

Show full article (14.11Kb)
    

Group: misc.education.homeschool.christian · Group Profile · Search for Asymptote Finding Vertical in misc.education.homeschool.christian
Author: Michael S. Morris
Date: Jun 2, 2007 10:02

Show full article (19.59Kb)
1 · 2 · 3 · next