Sciweavers

1920 search results - page 50 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 3 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
ICRA
2006
IEEE
97views Robotics» more  ICRA 2006»
15 years 3 months ago
Practical Kinematics for Real-time Implementation of Continuum Robots
Abstract - This paper introduces new analyses and algorithms which are essential for the practical implementation of continuous backbone continuum robots. Actuator length limits st...
Bryan A. Jones, William McMahan, Ian D. Walker
IJCAI
1997
14 years 11 months ago
Local Consistency for Ternary Numeric Constraints
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do n...
Boi Faltings, Esther Gelle
ICML
2001
IEEE
15 years 10 months ago
Learning to Generate Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
BIOINFORMATICS
2011
14 years 1 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....