Sciweavers

264 search results - page 30 / 53
» On the possibility of faster SAT algorithms
Sort
View
ACCV
2007
Springer
15 years 4 months ago
Task Scheduling in Large Camera Networks
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...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal
GD
2005
Springer
15 years 3 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
ICPR
2008
IEEE
15 years 11 months ago
Efficient image inner products applied to active appearance models
This paper introduces a clever way of computing inner products between images in order to drastically reduce the computational complexity of fitting appearance models to images. T...
Jan Erik Solem, Karl Netzell
SIGMOD
2005
ACM
118views Database» more  SIGMOD 2005»
15 years 10 months ago
RPJ: Producing Fast Join Results on Streams through Rate-based Optimization
We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temp...
Yufei Tao, Man Lung Yiu, Dimitris Papadias, Marios...
SIGGRAPH
2000
ACM
15 years 2 months ago
Deep shadow maps
We introduce deep shadow maps, a technique that produces fast, high-quality shadows for primitives such as hair, fur, and smoke. Unlike traditional shadow maps, which store a sing...
Tom Lokovic, Eric Veach