Sciweavers

905 search results - page 154 / 181
» On the Complexity of uSPR Distance
Sort
View
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 7 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
CVPR
2010
IEEE
14 years 3 months ago
SVM for Edge-Preserving Filtering
In this paper, we propose a new method to construct an edge-preserving filter which has very similar response to the bilateral filter. The bilateral filter is a normalized convolu...
Qingxiong Yang, Shengnan Wang, Narendra Ahuja
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 2 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
SI3D
2009
ACM
14 years 2 months ago
Dynamic solid textures for real-time coherent stylization
Stylized rendering methods, which aim at depicting 3D scenes with 2D marks such as pigments or strokes, are often faced with temporal coherence issues when applied to dynamic scen...
Pierre Bénard, Adrien Bousseau, Joëlle...
ICDCN
2009
Springer
14 years 2 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...