Sciweavers

4325 search results - page 133 / 865
» Incremental computation with names
Sort
View
SAINT
2006
IEEE
16 years 13 days ago
A Comparison of Two Programming Models for Pervasive Computing
1 Establishing suitable programming models for pervasive spaces is essential in improving the productivity, enhancing the quality of pervasive systems, and creating an open platfor...
Hen-I Yang, Erwin Jansen, Sumi Helal
DAM
2002
82views more  DAM 2002»
15 years 6 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
JUCS
2008
140views more  JUCS 2008»
15 years 6 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
SIGCSE
2006
ACM
179views Education» more  SIGCSE 2006»
16 years 11 days ago
Fifteen compilers in fifteen days
Traditional approaches to semester-long projects in compiler courses force students to implement the early stages of a compiler in depth; since many students fall behind, they hav...
Jeremy D. Frens, Andrew Meneely
ICCSA
2003
Springer
15 years 11 months ago
Robust Speaker Recognition Against Utterance Variations
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee