Sciweavers

1998 search results - page 322 / 400
» Complexity of the Cover Polynomial
Sort
View
119
Voted
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
15 years 10 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
BROADNETS
2006
IEEE
15 years 10 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
134
Voted
ICRA
2006
IEEE
148views Robotics» more  ICRA 2006»
15 years 10 months ago
Surface Patch Reconstruction via Curve Sampling
This paper introduces a method that reconstructs a surface patch by sampling along three concurrent curves on the surface with a touch sensor. These data curves, each lying in a d...
Yan-Bin Jia, Liangchuan Mi, Jiang Tian
ICRA
2006
IEEE
141views Robotics» more  ICRA 2006»
15 years 10 months ago
Computing 3-legged Equilibrium Stances in Three-dimensional Gravitational Environments
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....
Yizhar Or, Elon Rimon
IPPS
2006
IEEE
15 years 10 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien