Sciweavers

4403 search results - page 234 / 881
» Galois Theory of Algorithms
Sort
View
ENTCS
2006
124views more  ENTCS 2006»
15 years 6 months ago
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
Shuvendu K. Lahiri, Madanlal Musuvathi
COMPGEOM
2009
ACM
16 years 1 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
16 years 1 months ago
Vision based motion control for a humanoid head
— This paper describes the design of a motion control algorithm for a humanoid robotic head, which consists of a neck with four degrees of freedom and two eyes (a stereo pair sys...
Ludo C. Visser, Raffaella Carloni, Stefano Stramig...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
16 years 23 days ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
171
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld