Network profile

Gigili

Reputation

2,093

2.1k
1.9k
1.7k

2017
2018
2019
2020

Top tag

algorithms

Next privilege

2,500 Rep.

Create tag synonyms

Badges

3

18

29

Newest

Popular Question

Next badge

0/1

Impact

1 post edited

1 helpful flag

59 votes cast

16 Questions

Votes Activity Newest Views

1

vote

1

answer

45

views

Sources on dictionary learning and related algorithms

algorithms reference-request image-processing

Apr 18 at 10:03 Community♦ 1

17

28

votes

4

answers

31k

views

The time complexity of finding the diameter of a graph

algorithms time-complexity graphs

Jul 8 '17 at 18:34 Community♦ 1

1

5

votes

4

answers

4k

views

A DFA for recognizing comments

formal-languages automata finite-automata compilers

Apr 6 '16 at 7:21 Miles 103

8

14

votes

2

answers

11k

views

Are all context-free and regular languages efficiently decidable?

formal-languages regular-languages context-free efficiency

Sep 29 '15 at 19:51 Community♦ 1

0

votes

1

answer

41

views

What is the exact definition of a dictionary in the concept of linear algebra and computer science?

terminology image-processing linear-algebra

Feb 23 '15 at 7:10 Raphael♦ 68.3k

-2

votes

3

answers

1k

views

Does reachability belong to P?

complexity-theory graphs time-complexity

Feb 6 '14 at 7:39 Artem Kaznatcheev 4,592

-1

votes

2

answers

281

views

Each of the two sets is recursively enumerable given their cartesian product is

computability enumeration

May 12 '13 at 17:47 Quinn Culver 151

4

5

votes

6

answers

17k

views

Are Turing machines more powerful than pushdown automata?

formal-languages computability automata turing-machines pushdown-automata

Jan 16 '13 at 18:31 Community♦ 1

1

vote

1

answer

411

views

What factors must one consider choosing an NN structure?

artificial-intelligence neural-networks neural-computing

Jan 3 '13 at 6:58 AJed 2,322

5

votes

2

answers

612

views

If a predicate is not computable, what can be said about its negation?

computability proof-techniques

Oct 23 '12 at 23:59 Community♦ 1

4

votes

1

answer

285

views

How to prove or disprove that f is computable?

computability proof-techniques

Oct 23 '12 at 18:10 Pål GD 8,576

1

4

votes

1

answer

675

views

How to show that f(x) is primitive recursive?

computability recursion

Oct 17 '12 at 13:37 Dave Clarke 19.5k

17

votes

4

answers

830

views

Is this finite graph problem decidable? What factors make a problem decidable?

algorithms computability graphs undecidability

Apr 30 '12 at 21:37 Kaveh 20.7k

11

votes

1

answer

3k

views

Is an inﬁnite union of context-free languages always context-free?

formal-languages context-free closure-properties

Apr 25 '12 at 15:12 Patrick87 12.1k

5

votes

1

answer

704

views

Can every linear grammar be converted to Greibach form?

formal-languages formal-grammars

Mar 27 '12 at 3:09 Kaveh 20.7k

3

11

votes

5

answers

2k

views

A sufficient and necessary condition about regularity of a language

formal-languages regular-languages

Mar 15 '12 at 11:35 Raphael♦ 68.3k

Computer Science Stack Exchange works best with JavaScript enabled