1220 search results - page 116 / 244 » Restricting grammatical complexity |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
DOA
2000
13 years 9 months ago
2000
A corporate website is the virtual representation of a corporation or organization on the Internet. Corporate websites face numerous problems due to their large size and complexit...
DAGSTUHL
1997
13 years 9 months ago
1997
Finding one’s way through a complex virtual environment is a standard task in 3D graphics and virtual reality applications. Constrained navigation is a method that appropriately...
NIPS
2000
13 years 9 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
APCCM
2010
13 years 9 months ago
2010
Measuring information content (IC) from the intrinsic information of an ontology is an important however a formidable task. IC is useful for further measurement of the semantic si...