Sciweavers

1523 search results - page 295 / 305
» The Computational Complexity of Linear Optics
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
JSS
2011
126views more  JSS 2011»
12 years 10 months ago
A novel statistical time-series pattern based interval forecasting strategy for activity durations in workflow systems
Forecasting workflow activity durations is of great importance to support satisfactory QoS in workflow systems. Traditionally, a workflow system is often designed to facilitate the...
Xiao Liu, Zhiwei Ni, Dong Yuan, Yuan-Chun Jiang, Z...
CVPR
2012
IEEE
11 years 10 months ago
Bag of textons for image segmentation via soft clustering and convex shift
We propose an unsupervised image segmentation method based on texton similarity and mode seeking. The input image is first convolved with a filter-bank, followed by soft cluster...
Zhiding Yu, Ang Li, Oscar C. Au, Chunjing Xu
ICIP
2002
IEEE
14 years 9 months ago
Matching pursuits video coding using generalized bit-planes
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...
Alexandre G. Ciancio, Eduardo A. B. da Silva, Rog&...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen