Sciweavers

976 search results - page 22 / 196
» The Complexity of Timetable Construction Problems
Sort
View
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
13 years 12 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
IJFCS
2007
77views more  IJFCS 2007»
13 years 7 months ago
Optimal Construction of Sense of Direction in a Torus by a Mobile Agent
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the ...
Hanane Becha, Paola Flocchini
ICDT
2009
ACM
143views Database» more  ICDT 2009»
14 years 8 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
BMCBI
2008
96views more  BMCBI 2008»
13 years 7 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
COMCOM
1998
106views more  COMCOM 1998»
13 years 7 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...