Sciweavers

457 search results - page 41 / 92
» Upper and Lower Bounds on Continuous-Time Computation
Sort
View
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 3 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...
ICALP
2004
Springer
15 years 11 months ago
Coordination Mechanisms
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
George Christodoulou, Elias Koutsoupias, Akash Nan...
CAISE
1999
Springer
15 years 10 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 10 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
IDA
2007
Springer
15 years 6 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando