Sciweavers

2127 search results - page 133 / 426
» Computing large matchings fast
Sort
View
SC
2009
ACM
15 years 10 months ago
OddCI: on-demand distributed computing infrastructure
The availability of large quantities of processors is a crucial enabler of many-task computing. Voluntary computing systems have proven that it is possible to build computing plat...
Rostand Costa, Francisco V. Brasileiro, Guido Lemo...
ESCIENCE
2007
IEEE
15 years 10 months ago
Decentralised Resource Discovery Service for Large Scale Federated Grids
Efficient Resource discovery mechanism is one of the fundamental requirement for Grid computing systems, as it aids in resource management and scheduling of applications. Resourc...
Rajiv Ranjan, Lipo Chan, Aaron Harwood, Shanika Ka...
ICCV
2009
IEEE
15 years 1 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
CGF
2007
158views more  CGF 2007»
15 years 4 months ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
IMC
2006
ACM
15 years 10 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...