Sciweavers

8512 search results - page 24 / 1703
» Computing Theory With Relevance
Sort
View
STACS
2001
Springer
15 years 3 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
DIGRA
2005
Springer
15 years 4 months ago
Towards an Ontological Language for Game Analysis
The Game Ontology Project (GOP) is creating a framework for describing, analyzing and games, by defining a hierarchy of concepts abstracted from an analysis of many specific games...
José Pablo Zagal, Michael Mateas, Clara Fer...
ENTCS
2006
110views more  ENTCS 2006»
14 years 11 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
ICCV
2011
IEEE
13 years 11 months ago
HEAT: Iterative Relevance Feedback with One Million Images
It has been shown repeatedly that iterative relevance feedback is a very efficient solution for content-based image retrieval. However, no existing system scales gracefully to hu...
Nicolae Suditu, Francois Fleuret
85
Voted
SIGCSE
2002
ACM
178views Education» more  SIGCSE 2002»
14 years 10 months ago
Making compiler design relevant for students who will (most likely) never design a compiler
Compiler Design courses are a common component of most modern Computer Science undergraduate curricula. At the same time, however, compiler design has become a highly specialized ...
Saumya K. Debray