Sciweavers

4865 search results - page 507 / 973
» The Complexity of Graph Connectivity
Sort
View
ICALP
2007
Springer
16 years 1 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
DIAL
2006
IEEE
103views Image Analysis» more  DIAL 2006»
16 years 1 months ago
Multi-Queue Merging Scheme And Its Application in Arabic Script Segmentation
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
Pingping Xiu, Liangrui Peng, Xiaoqing Ding
APVIS
2007
15 years 8 months ago
Visualisation and analysis of the internet movie database
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...
Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-He...
UAI
2004
15 years 8 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
SIVP
2010
118views more  SIVP 2010»
15 years 5 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray