358 search results - page 29 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
104
click to vote
NSDI
2008
15 years 4 months ago
2008
Large-scale network services can consist of tens of thousands of machines running thousands of unique software configurations spread across hundreds of physical networks. Testing ...
131
click to vote
BMCBI
2007
15 years 2 months ago
2007
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...
146
click to vote
HUMO
2007
Springer
15 years 8 months ago
2007
Springer
We describe a “bag-of-rectangles” method for representing and recognizing human actions in videos. In this method, each human pose in an action sequence is represented by orien...
105
click to vote
PDCAT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
126
click to vote
CRYPTO
2005
Springer
15 years 7 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...