Sciweavers

614 search results - page 52 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 7 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
CAISE
1999
Springer
15 years 2 months ago
Time Constraints in Workflow Systems
Time management is a critical component of workflow-based process management. Important aspects of time management include planning of workflow process execution in time, estimat...
Johann Eder, Euthimios Panagos, Michael Rabinovich
ICCI
1993
15 years 2 months ago
Interval-Set Algebra for Qualitative Knowledge Representation
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
Y. Y. Yao
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
14 years 9 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 5 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...