10271 search results - page 583 / 2055 » Computer Science |
172
click to vote
ITICSE
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we describe the use of some cooperative learning methodology sessions in a Project Based Learning course, in order to cover those topics uncovered by the project. C...
167
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
180
click to vote
RTA
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
167
click to vote
WG
2004
Springer
16 years 12 days ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
181
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...