Sciweavers

2527 search results - page 62 / 506
» Discrete optimization in computer vision
Sort
View
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Online hardware/software partitioning in networked embedded systems
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...
Thilo Streichert, Christian Haubelt, Jürgen T...
97
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
103
Voted
BMCBI
2006
95views more  BMCBI 2006»
15 years 19 days ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 1 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
101
Voted
HYBRID
2007
Springer
15 years 4 months ago
A Hybrid Bellman Equation for Bimodal Systems
Abstract. In this paper we present a dynamic programming formulation of a hybrid optimal control problem for bimodal systems with regional dynamics. In particular, based on optimal...
Peter E. Caines, Magnus Egerstedt, Roland P. Malha...