Sciweavers

43 search results - page 6 / 9
» Fast Probabilistic Modeling for Combinatorial Optimization
Sort
View
CVPR
2008
IEEE
15 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
14 years 11 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
CODES
2008
IEEE
15 years 4 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra
NIPS
2008
14 years 11 months ago
Hebbian Learning of Bayes Optimal Decisions
Uncertainty is omnipresent when we perceive or interact with our environment, and the Bayesian framework provides computational methods for dealing with it. Mathematical models fo...
Bernhard Nessler, Michael Pfeiffer, Wolfgang Maass
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
15 years 3 months ago
Learning What Makes a Society Tick
We present a machine learning methodology (models, algorithms, and experimental data) to discovering the agent dynamics that drive the evolution of the social groups in a communit...
Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Is...