Sciweavers

13306 search results - page 468 / 2662
» Theoretical Computer Science
Sort
View
FOCS
1999
IEEE
15 years 12 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
CSE
2009
IEEE
16 years 2 months ago
A Survey of Human Computation Systems
—Human computation is a technique that makes use of human abilities for computation to solve problems. The human computation problems are the problems those computers are not goo...
Man-Ching Yuen, Ling-Jyh Chen, Irwin King
ITICSE
2006
ACM
16 years 1 months ago
Encouraging the development of undergraduate researchers in computer vision
In a small computer science department without a graduate program, it is sometimes difficult to attract research students. This is particularly true for research in computer visio...
Clark F. Olson
WG
2004
Springer
16 years 29 days ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
WG
2004
Springer
16 years 29 days ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...