Sciweavers

3628 search results - page 451 / 726
» Approaching the Physical Limits of Computing
Sort
View
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
MIDDLEWARE
2005
Springer
16 years 6 days ago
Middleware for protocol-based coordination in dynamic networks
Pervasive and ad hoc computing applications are frequently deployed in dynamic networks. Due to mobility of the computing nodes, their unreliability, or a limited communication ra...
Kurt Schelfthout, Danny Weyns, Tom Holvoet
GRID
2004
Springer
16 years 2 days ago
Distributed Ant: A System to Support Application Deployment in the Grid
e-Science has much to benefit from the emerging field of grid computing. However, construction of e-Science grids is a complex and inefficient undertaking. In particular, deployme...
Wojtek Goscinski, David Abramson
ISVC
2010
Springer
15 years 4 months ago
Object Category Classification Using Occluding Contours
Abstract. Occluding contour (OC) plays important roles in many computer vision tasks. The study of using OC for visual inference tasks is however limited, partially due to the lack...
Jin Sun, Christopher Thorpe, Nianhua Xie, Jingyi Y...
CGF
2010
171views more  CGF 2010»
15 years 3 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu