12015 search results - page 596 / 2403 » Interactive Algorithms 2005 |
191
click to vote
OTM
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can b...
142
click to vote
CHI
2008
ACM
16 years 6 months ago
2008
ACM
Reading detection is an important step in the process of automatic relevance feedback generation based on eye movements for information retrieval tasks. We describe a reading dete...
185
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
145
Voted
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi...
170
Voted
ACIVS
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...