Sciweavers

109 search results - page 15 / 22
» Program Specialization via Program Slicing
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
JMLR
2011
148views more  JMLR 2011»
14 years 4 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
ISCA
2000
IEEE
99views Hardware» more  ISCA 2000»
15 years 2 months ago
Transient fault detection via simultaneous multithreading
Smaller feature sizes, reduced voltage levels, higher transistor counts, and reduced noise margins make future generations of microprocessors increasingly prone to transient hardw...
Steven K. Reinhardt, Shubhendu S. Mukherjee
FAST
2009
14 years 7 months ago
Enabling Transactional File Access via Lightweight Kernel Extensions
Transactions offer a powerful data-access method used in many databases today trough a specialized query API. User applications, however, use a different fileaccess API (POSIX) wh...
Richard P. Spillane, Sachin Gaikwad, Manjunath Chi...