Sciweavers

1161 search results - page 95 / 233
» Approximation schemes for clustering problems
Sort
View
129
Voted
ICC
2008
IEEE
112views Communications» more  ICC 2008»
15 years 10 months ago
Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
Javad Ghaderi, Liang-Liang Xie, Xuemin Shen
138
Voted
CLUSTER
2008
IEEE
15 years 10 months ago
Enabling lock-free concurrent fine-grain access to massive distributed data: Application to supernovae detection
—We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and ac...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
147
Voted
CVPR
2012
IEEE
13 years 6 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
CAD
2004
Springer
15 years 3 months ago
Control point adjustment for B-spline curve approximation
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
Huaiping Yang, Wenping Wang, Jia-Guang Sun
217
Voted
VLDB
2002
ACM
120views Database» more  VLDB 2002»
16 years 3 months ago
Efficient schemes for managing multiversionXML documents
Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and "...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo