Sciweavers

416 search results - page 46 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
TACAS
1998
Springer
98views Algorithms» more  TACAS 1998»
13 years 12 months ago
Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation
This paper enables symbolic ternary simulation of systems with large embedded memories. Each memory array is replaced with a behavioral model, where the number of symbolic variable...
Miroslav N. Velev, Randal E. Bryant
JMLR
2010
147views more  JMLR 2010»
13 years 2 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
ECCV
2010
Springer
13 years 5 months ago
Discriminative Nonorthogonal Binary Subspace Tracking
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
Ang Li, Feng Tang, Yanwen Guo, Hai Tao
WEBI
2005
Springer
14 years 1 months ago
IPR: Automated Interaction Process Reconciliation
Inter-organizational business processes usually require complex and time-consuming interactions between partners than simple interactions supported by WSDL. Automated reconciliati...
Zongxia Du, Jinpeng Huai, Yunhao Liu, Chunming Hu,...