1368 search results - page 5 / 274 » Avoiding Simplicity Is Complex |
SAC
2005
ACM
14 years 3 months ago
2005
ACM
Complex application-specific media instructions and kernels are emulated with simple to implement extended subword instructions. We show that assuming extended register file ent...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
MFCS
1997
Springer
14 years 1 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
TSP
2008
13 years 9 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
RAS
2006
13 years 9 months ago
2006
In this paper, we study coordinated motion in a swarm robotic system, called a swarm-bot. A swarm-bot is a self-assembling and self-organising artifact, composed of a swarm of s-b...