Sciweavers

2168 search results - page 21 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 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
DSN
2007
IEEE
14 years 2 months ago
BlackJack: Hard Error Detection with Redundant Threads on SMT
Testing is a difficult process that becomes more difficult with scaling. With smaller and faster devices, tolerance for errors shrinks and devices may act correctly under certain ...
Ethan Schuchman, T. N. Vijaykumar
ATAL
2009
Springer
14 years 2 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
ICPR
2006
IEEE
14 years 8 months ago
Exact View-Dependent Visual Hulls
The visual hull is widely used to produce three dimensional models from multiple views, due to the reliability of the resulting surface. This paper presents a novel method for eff...
Adrian Hilton, Gregor Miller
CHI
2007
ACM
14 years 8 months ago
Hard lessons: effort-inducing interfaces benefit spatial learning
Interface designers normally strive for a design that minimises the user's effort. However, when the design's objective is to train users to interact with interfaces tha...
Andy Cockburn, Per Ola Kristensson, Jason Alexande...