Sciweavers

76 search results - page 10 / 16
» Asking Questions to Minimize Errors
Sort
View
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 2 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
PVLDB
2008
94views more  PVLDB 2008»
13 years 7 months ago
Dynamic active probing of helpdesk databases
Helpdesk databases are used to store past interactions between customers and companies to improve customer service quality. One common scenario of using helpdesk database is to fi...
Shenghuo Zhu, Tao Li, Zhiyuan Chen, Dingding Wang,...
MHCI
2004
Springer
14 years 24 days ago
A Prototype for Remote Vehicle Diagnostics
Abstract. The field of Remote Vehicle Diagnostics can be described as the remote management of vehicles equipped with electronic control systems. Despite the great potential that i...
Jonas Kuschel, Henrik Fagrell, Carl Johan Andersso...
TNN
2011
129views more  TNN 2011»
13 years 2 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
GRAPHICSINTERFACE
1997
13 years 8 months ago
The Immediate Usability of Graffiti
We present four empirical measures of the immediate usability of Graffiti, a character recognizer for pen-based computers. Since speed is fully controlled by the user, we measured...
I. Scott MacKenzie, Shawn X. Zhang