Sciweavers

5595 search results - page 927 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
TKDE
2008
162views more  TKDE 2008»
15 years 6 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
ER
2010
Springer
121views Database» more  ER 2010»
15 years 5 months ago
Reasoning with Optional and Preferred Requirements
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
Neil A. Ernst, John Mylopoulos, Alexander Borgida,...
SDM
2010
SIAM
129views Data Mining» more  SDM 2010»
15 years 4 months ago
Cross-Selling Optimization for Customized Promotion
The profit of a retail product not only comes from its own sales, but also comes from its influence on the sales of other products. How to promote the right products to the righ...
Nan Li, Yinghui Yang, Xifeng Yan
ADHOCNOW
2010
Springer
15 years 4 months ago
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...