976 search results - page 60 / 196 » The Complexity of Timetable Construction Problems |
COGSCI
2004
13 years 9 months ago
2004
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
ISIM
2007
13 years 10 months ago
2007
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
We demonstrate a novel query interface that enables users to construct a rich search query without any prior knowledge of the underlying schema or data. The interface, which is in...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
PC
2000
13 years 8 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...