Sciweavers

1760 search results - page 82 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 3 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
13 years 8 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
KBSE
2002
IEEE
14 years 1 months ago
Adapting Applications on the Fly
Traditionally, an application has to be stopped to be adapted. This approach is not suitable for critical systems that have to be non-stop and highly available like bank, internet...
Abdelmadjid Ketfi, Noureddine Belkhatir, Pierre-Yv...
ICLP
1997
Springer
14 years 15 days ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 8 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu