Sciweavers

24 search results - page 2 / 5
» Horizontal Composability Revisited
Sort
View
104
Voted
ICALP
2009
Springer
16 years 2 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
APLAS
2007
ACM
15 years 5 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
ESAW
2006
Springer
15 years 5 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
125
Voted
ICARCV
2006
IEEE
147views Robotics» more  ICARCV 2006»
15 years 7 months ago
Paddle Juggling of one Ball by Robot Manipulator with Visual Servo
Abstract— This paper propose a method to achieve paddle juggling of a ball by a racket attached to a robot manipulator with two visual camera sensors. The proposed method is comp...
Akira Nakashima, Yoshiyasu Sugiyama, Yoshikazu Hay...
119
Voted
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 3 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su