Sciweavers

4674 search results - page 48 / 935
» cases 2008
Sort
View
DAM
2008
131views more  DAM 2008»
14 years 12 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
ECCC
2008
98views more  ECCC 2008»
14 years 12 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
ENTCS
2008
102views more  ENTCS 2008»
14 years 12 months ago
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
Alexander Kurz, Daniela Petrisan
ENTCS
2008
118views more  ENTCS 2008»
14 years 12 months ago
Barbed Model-Driven Software Development: A Case Study
When thinking of MDE, the immediate understanding is that models drive software development, in the at the software is constructed by transforming models from higher levels of abs...
Carlo Montangero, Laura Semini
IIE
2008
112views more  IIE 2008»
14 years 11 months ago
Towards a Blended Learning Model for Teaching and Learning Computer Programming: A Case Study
Blended learning is becoming an attractive model in higher education as new innovative information technologies are becoming increasingly available. However, just blending face-to-...
Said Hadjerrouit