1285 search results - page 4 / 257 » On the Complexity of Ordinal Clustering |
206
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
130
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes critical factors for co-ordinated enterprise and IS/IT development and change in complex organizations in Sweden. These factors represent an answer on the cru...
151
click to vote
LICS
2008
IEEE
16 years 11 days ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
177
click to vote
AMFG
2007
IEEE
16 years 9 days ago
2007
IEEE
In this paper, we propose a novel appearance-based representation, called Structured Ordinal Feature (SOF). SOF is a binary string encoded by combining eight ordinal blocks in a ci...
112
click to vote
CLUSTER
2007
IEEE
2007
IEEE
Complexity results for throughput and latency optimization of replicated and data-parallel workflows
16 years 9 days ago
