Sciweavers

1433 search results - page 125 / 287
» On Covering Problems of Rado
Sort
View
SIGCSE
2008
ACM
160views Education» more  SIGCSE 2008»
15 years 6 months ago
CS 0.5: a better approach to introductory computer science for majors
There are often problems when students enter a course with widely different experience levels with key course topics. If the material is covered too slowly, those with greater exp...
Robert H. Sloan, Patrick Troy
NETWORKS
2007
15 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 4 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
CHI
2006
ACM
16 years 7 months ago
A study of the use of mobile phones by older persons
This paper reports on issues related to the use of mobile phones by older people. This study uses triangulation, a mixed method of qualitative (focus group discussions) and quanti...
Sri Hastuti Kurniawan, Murni Mahmud, Yanuar Nugroh...
ICRA
2008
IEEE
129views Robotics» more  ICRA 2008»
16 years 29 days ago
Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments
— The problem of appearance-based mapping and navigation in outdoor environments is far from trivial. In this paper, an appearance-based topological map, covering a large, mixed ...
Christoffer Valgren, Achim J. Lilienthal