Sciweavers

25 search results - page 4 / 5
» Online Maximum Directed Cut
Sort
View
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
14 years 6 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
IWMMDBMS
1998
117views more  IWMMDBMS 1998»
13 years 7 months ago
Motion-based Parsing of Compressed Video
An algorithm for detecting scene changes in compressed video streams is proposed. The proposed algorithm directly exploits the motion compensation information and the prediction e...
Suchendra M. Bhandarkar, Aparna A. Khombhadia
ICML
2009
IEEE
14 years 7 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
JAL
2006
89views more  JAL 2006»
13 years 6 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler