9997 search results - page 369 / 2000 » The case for crowd computing |
158
click to vote
INFOCOM
1993
IEEE
15 years 11 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
155
click to vote
ACL
2009
15 years 4 months ago
2009
It is usually assumed that the kind of noise existing in annotated data is random classification noise. Yet there is evidence that differences between annotators are not always ra...
165
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 1 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
193
click to vote
PARA
2004
Springer
16 years 3 days ago
2004
Springer
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...
143
click to vote
HICSS
2007
IEEE
16 years 1 months ago
2007
IEEE
Prior research suggests people have trouble juggling effort across multiple projects with multiple partners. We investigated this problem, with an experiment where groups of four ...