Sciweavers

390 search results - page 70 / 78
» Set Intersection Theorems and Existence of Optimal Solutions
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 2 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
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 5 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
WWW
2011
ACM
13 years 2 months ago
Semi-supervised truth discovery
Accessing online information from various data sources has become a necessary part of our everyday life. Unfortunately such information is not always trustworthy, as different sou...
Xiaoxin Yin, Wenzhao Tan
INFOCOM
2003
IEEE
14 years 28 days ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
PVLDB
2010
92views more  PVLDB 2010»
13 years 6 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi