Sciweavers

5493 search results - page 313 / 1099
» Effectively Polynomial Simulations
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
INFOCOM
2005
IEEE
16 years 8 days ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 11 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
VR
2000
IEEE
174views Virtual Reality» more  VR 2000»
15 years 11 months ago
Optimization-Based Virtual Surface Contact Manipulation at Force Control Rates
Previous interactive works have used springs, heuristics, and dynamics for surface placement applications. We present an analytical technique for kilohertz rate manipulation of CA...
Donald D. Nelson, Elaine Cohen
BMCBI
2010
233views more  BMCBI 2010»
15 years 6 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...