3946 search results - page 99 / 790 » The computational complexity of choice sets |
212
click to vote
TCOS
2008
15 years 6 months ago
2008
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
174
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
177
click to vote
RTSS
2008
IEEE
16 years 25 days ago
2008
IEEE
With the advent of increasingly complex hardware in realtime embedded systems (processors with performance enhancing features such as pipelines, cache hierarchy, multiple cores), ...
145
click to vote
PRDC
2007
IEEE
16 years 22 days ago
2007
IEEE
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
153
click to vote
DLT
2006
15 years 7 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...