563 search results - page 84 / 113 » Computing approximate PSD factorizations |
CVPR
2007
IEEE
14 years 12 months ago
2007
IEEE
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape mo...
SPIN
2009
Springer
14 years 4 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...
ACCV
2007
Springer
14 years 4 months ago
2007
Springer
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...