« first day (1828 days earlier)      last day (2907 days later) » 

YSharp
YSharp
07:52
@vzn : Lambda the Ultimate (aka LtU) is a programming language weblog, for discussions about programming language design, theory, practice, etc. It isn't mine, I'm just one of the posters over there. Cheers.
 
4 hours later…
Jim
Jim
11:35
I would like to know about state-of- the-art algorithm in face detection (Viola-Jones was in the past), is CSE a good place to ask or I should try somewhere else?
 
5 hours later…
Bounty!
Bounty!
16:56
3
Q: Class of Algorithms where finding output of algorithm can be aided by output of same algorithm given a similar input

MichaelSorry for the confusing title, but I'm trying to find out if a certain algorithm or class of algorithms fits this description. Given an algorithm A, computing A(x) can be computionally easier if A(g) is known, where g is close to x, and it's easier the closer g gets to x. So also, the amount of c...

algorithms complexity-theory
 
1 hour later…
vzn
vzn
17:56
@YSharp looks like you are interested in (optimizing) parsing complexity of CFLs? that is indeed an area of research, you might look into what is known. you are cyril on the site? another past cohort here likes that site :)
Sep 14 '15 at 16:08, by Thomas Klimpel
@Raphael I just wanted to add some Community Promotion Ads. I first searched for a ready made "cstheory.se" ad, but couldn't find one. I didn't want to ruin that one by creating a bad image, so I tried my luck with reddit instead. I also have "lambda the ultimate" in my queue for creating an image and posting it as ad. To label them as "share and discuss" sounds friendlier than to admit that I visit such sites while I procrastinate.
Carlos
Carlos
18:30
people.idsia.ch/~juergen/toesv2/node6.html says monotone Turing machines need one output tape and at least two work tapes. Why two work tapes instead of one?
vzn
vzn
19:18
@Carlos it does seem like 1 should be sufficient! maybe this ref explains it? [#!LiVitanyi:97!#, p. 276 ff]
 
1 hour later…
Carlos
Carlos
20:39
@vzn I'll take a look. “Algorithmic Probability and Friends” by Dowe says “Definition 1. A monotone Turing machine is a computer with binary (one-way) input and output tapes, a bidirectional binary work tape (with read/write heads as appropriate) and a finite state machine to determine its actions given input and work tape values. The input tape is read-only, the output tape is write-only.”
That seems to indicate that only one work tape is needed.
vzn
vzn
21:00
@Carlos maybe the ref you found is referring to a one-way input tape as a "work tape"? and has no "input tape"? that seems to explain it & be equivalent
> The only input-related instruction requests an input bit determined by an external process and copies it onto the square above the first work tape scanning head.
Carlos
Carlos
@vzn Yeah that makes more sense.
 
2 hours later…
Travis J
Travis J
22:51
I am trying to identify the name of an algorithm, or the name of the type of algorithm, for solving a rather simple problem. Given the word "factory", I am producing "fa fac fact facto factor factory ac act acto actor actory ct cto ctor ctory to tor tory or ory ry". It is part of an approach for statistical analysis where the word "factory" is representative of a maximum path in a graph. Anyone know the type of algorithm that would be formally named?
Travis J
Travis J
23:49
Please disregard this question, perhaps it worked more as rubber ducking than anything :)

« first day (1828 days earlier)      last day (2907 days later) »