3122 search results - page 260 / 625 » A Theory of Network Equivalence |
174
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
169
click to vote
FORTE
2008
15 years 8 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
224
click to vote
ICVGIP
2008
15 years 8 months ago
2008
Following the phenomenological approach of gestaltists, sparse monocular depth cues such as T- and X-junctions and the local convexity are crucial to identify the shape and depth ...
146
click to vote
IADIS
2004
15 years 8 months ago
2004
Two sets of multimedia learning materials were compared for their ability to promote learning of introductory computer programming The first set of materials was a sequentially na...
160
click to vote
ACL
1998
15 years 8 months ago
1998
We propose a comprehensive theory of codemixed discourse, encompassing equivalencepoint and insertional code-switching, palindromic constructions and lexical borrowing. The starti...