1285 search results - page 4 / 257 » On the Complexity of Ordinal Clustering |
LICS
2012
IEEE
11 years 10 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...
HICSS
2003
IEEE
14 years 25 days 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...
LICS
2008
IEEE
14 years 1 months 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...
AMFG
2007
IEEE
14 years 1 months 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...
CLUSTER
2007
IEEE
2007
IEEE
Complexity results for throughput and latency optimization of replicated and data-parallel workflows
14 years 1 months ago
