Sciweavers

668 search results - page 26 / 134
» Hyperrelations in version space
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt
ICRA
2002
IEEE
148views Robotics» more  ICRA 2002»
14 years 1 months ago
Experiments with Nonholonomic Manipulation
This paper summarizes ongoing work with a mobile manipulator (Mobipulator). We describe the system architecture of the latest version of the robot, a hierarchy of robot motion com...
Siddhartha S. Srinivasa, Christopher R. Baker, Eli...
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 10 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
SAINT
2006
IEEE
14 years 2 months ago
A Pervasive Internet Approach to Fine-Grain Power-Aware Computing
We present a novel approach to conserve power in networked mobile devices. Our approach exploits communication within a pervasive smart space as an opportunity to save power as op...
Ahmed Abukmail, Abdelsalam Helal
AFRICACRYPT
2008
Springer
14 years 3 months ago
Improving Integral Attacks Against Rijndael-256 Up to 9 Rounds
Rijndael is a block cipher designed by V. Rijmen and J. Daemen and it was chosen in its 128-bit block version as AES by the NIST in October 2000. Three key lengths - 128, 192 or 25...
Samuel Galice, Marine Minier