Sciweavers

2316 search results - page 74 / 464
» The many forms of hypercomputation
Sort
View
128
Voted
JAT
2002
62views more  JAT 2002»
15 years 3 months ago
Coconvex Approximation
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
Dany Leviatan, Igor A. Shevchuk
ICRA
2010
IEEE
79views Robotics» more  ICRA 2010»
15 years 2 months ago
Robot pebbles: One centimeter modules for programmable matter through self-disassembly
— This paper describes the design, fabrication, and experimental results of a programmable matter system capable of 2D shape formation through subtraction. The system is composed...
Kyle Gilpin, Ara Knaian, Daniela Rus
TCOM
2010
143views more  TCOM 2010»
15 years 2 months ago
Bursty relay networks in low-SNR regimes
—In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying ...
Tony Q. S. Quek, Hyundong Shin
VL
2010
IEEE
160views Visual Languages» more  VL 2010»
15 years 2 months ago
Toward End-User Debugging of Machine-Learned Classifiers
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a generat...
Todd Kulesza
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 2 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen