4066 search results - page 640 / 814 » Almost Complete Sets |
160
click to vote
EOR
2010
15 years 7 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
187
Voted
ALGORITHMICA
2006
15 years 7 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
180
click to vote
ENTCS
2008
15 years 7 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
175
Voted
ENTCS
2008
15 years 7 months ago
2008
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
199
Voted
ERCIM
2008
15 years 7 months ago
2008
Information and Communication Technologies facilitate the emergence of new contexts and practices of learning that educational institutions have to adapt to their pedagogical disc...