Sciweavers

1091 search results - page 192 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning methods for lung tumor markerless gating in image-guided radiotherapy
In an idealized gated radiotherapy treatment, radiation is delivered only when the tumor is at the right position. For gated lung cancer radiotherapy, it is difficult to generate ...
Ying Cui, Jennifer G. Dy, Gregory C. Sharp, Brian ...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
CIKM
2003
Springer
14 years 1 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
CVPR
2006
IEEE
14 years 2 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
STACS
1999
Springer
14 years 12 days ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann