6105 search results - page 814 / 1221 » A Parallel Algorithm for Bound-Smoothing |
165
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
181
click to vote
ICDCS
2009
IEEE
16 years 4 months ago
2009
IEEE
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
155
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
K-Means is a clustering algorithm that is widely applied in many elds, including pattern classi cation and multimedia analysis. Due to real-time requirements and computational-cos...
219
Voted
CBMS
2007
IEEE
16 years 1 months ago
2007
IEEE
Microarray gene expression image analysis is a labor-intensive task and requires human intervention since microarray images are contaminated with noise and artifacts while spots a...
183
click to vote
CONCUR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...