4865 search results - page 859 / 973 » The Complexity of Graph Connectivity |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
ICIC
2009
Springer
15 years 4 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
AVSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Tracking humans in an indoor environment is an essential part of surveillance systems. Vision based and microphone array based trackers have been extensively researched in the pas...