Sciweavers

1487 search results - page 132 / 298
» The Computational Complexity of Link Building
Sort
View
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
15 years 9 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
DSVIS
2008
Springer
15 years 6 months ago
ReWiRe: Designing Reactive Systems for Pervasive Environments
The design of interactive software that populates an ambient space is a complex and ad-hoc process with traditional software development approaches. In an ambient space, important ...
Geert Vanderhulst, Kris Luyten, Karin Coninx
MOBISYS
2007
ACM
16 years 4 months ago
Real-time deployment of multihop relays for range extension
When the range of single-hop wireless communication is limited by distance or harsh radio propagation conditions, relays can be used to extend the communication range through mult...
Michael R. Souryal, Johannes Geissbuehler, Leonard...
CAD
2005
Springer
15 years 4 months ago
Fidelity in visualizing large-scale simulations
Computer simulations are powerful tools frequently used today in many important applications, for example to build safer buildings, to crash-test an automobile before it is built,...
Voicu Popescu, Christoph M. Hoffmann
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 5 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich