Sciweavers

1539 search results - page 258 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
TIP
2002
107views more  TIP 2002»
15 years 1 months ago
Dequantizing image orientation
Abstract--We address the problem of computing a local orientation map in a digital image. We show that standard image gray level quantization causes a strong bias in the repartitio...
Agnès Desolneux, Saïd Ladjal, Lionel M...
142
Voted
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 17 days ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
153
Voted
NOCS
2008
IEEE
15 years 8 months ago
Network Simplicity for Latency Insensitive Cores
In this paper we examine a latency insensitive network composed of very fast and simple circuits that connects SoC cores that are also latency insensitive, de-synchronized, or asy...
Daniel Gebhardt, JunBok You, W. Scott Lee, Kenneth...
ICDM
2006
IEEE
91views Data Mining» more  ICDM 2006»
15 years 8 months ago
Entropy-based Concept Shift Detection
When monitoring sensory data (e.g., from a wearable device) the context oftentimes changes abruptly: people move from one situation (e.g., working quietly in their office) to ano...
Peter Vorburger, Abraham Bernstein
119
Voted
SI3D
2009
ACM
15 years 9 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...