Sciweavers

2621 search results - page 271 / 525
» Near orders and codes
Sort
View
DLS
2009
227views Languages» more  DLS 2009»
15 years 4 months ago
The ruby intermediate language
Ruby is a popular, dynamic scripting language that aims to "feel natural to programmers"and give users the"freedom to choose" among many different ways of doin...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 6 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
CVPR
2005
IEEE
16 years 8 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 7 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
186
Voted
ICC
2007
IEEE
124views Communications» more  ICC 2007»
16 years 1 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy