Sciweavers

868 search results - page 89 / 174
» Efficiency as a Motivation to Team
Sort
View
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
AMAI
2008
Springer
13 years 9 months ago
Mixed deterministic and probabilistic networks
Abstract The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to devel...
Robert Mateescu, Rina Dechter
CACM
2010
105views more  CACM 2010»
13 years 9 months ago
Censored exploration and the dark pool problem
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...
CGF
2010
98views more  CGF 2010»
13 years 9 months ago
Fast Generation of Pointerless Octree Duals
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
Thomas Lewiner, Vinícius Mello, Adelailson ...
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 9 months ago
Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...