10271 search results - page 332 / 2055 » Self-plagiarism in computer science |
200
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
185
Voted
CVGIP
2011
15 years 2 months ago
2011
206
Voted
TCS
2011
15 years 2 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
166
Voted
CORR
2006
Springer
15 years 7 months ago
2006
Springer
ed from the Physical Sciences Inc. Library. Abstract available at http://www.psicorp.com/publications/sr-1278.shtml