Sciweavers

12459 search results - page 14 / 2492
» cans 2006
Sort
View
CSMR
2006
IEEE
14 years 1 months ago
Can LSI help Reconstructing Requirements Traceability in Design and Test?
Managing traceability data is an important aspect of the software development process. In this paper we investigate to what extent latent semantic indexing (LSI), an information r...
Marco Lormans, Arie van Deursen
APAL
2006
64views more  APAL 2006»
13 years 7 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
PERSUASIVE
2007
Springer
14 years 1 months ago
Can Brotherhood Be Sold Like Soap...Online? An Online Social Marketing and Advocacy Pilot Study Synopsis
: Having engaged one billion users by early 2006, the Internet is the world’s fastest-growing mass communications medium. As it permeates into countless lives across the planet, ...
Brian Cugelman, Mike Thelwall, Phil Dawes
SIGCSE
2006
ACM
130views Education» more  SIGCSE 2006»
14 years 1 months ago
Can graduating students design software systems?
This paper examines software designs produced by students nearing completion of their Computer Science degrees. The results of this multi-national, multi-institutional experiment ...
Anna Eckerdal, Robert McCartney, Jan Erik Mostr&ou...
CORR
2006
Springer
81views Education» more  CORR 2006»
13 years 7 months ago
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
Emin Martinian, Martin J. Wainwright