Sciweavers

1787 search results - page 199 / 358
» Approximation Techniques for Spatial Data
Sort
View
163
Voted
TOG
2002
129views more  TOG 2002»
15 years 5 months ago
Fast bilateral filtering for the display of high-dynamic-range images
We present a new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail. It is based on a two-scale decomposition of the image ...
Frédo Durand, Julie Dorsey
JGO
2010
100views more  JGO 2010»
15 years 8 days ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
CORR
2004
Springer
147views Education» more  CORR 2004»
15 years 5 months ago
Collaborative Storage Management In Sensor Networks
In this paper, we consider a class of sensor networks where the data is not required in real-time by an observer; for example, a sensor network monitoring a scientific phenomenon ...
Sameer Tilak, Nael B. Abu-Ghazaleh, Wendi Rabiner ...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 5 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
RTAS
2003
IEEE
15 years 10 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee