Sciweavers

1977 search results - page 3 / 396
» The satisfactory partition problem
Sort
View
82
Voted
ORL
2007
82views more  ORL 2007»
14 years 9 months ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse
CVPR
2008
IEEE
15 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
67
Voted
IJSYSC
2010
92views more  IJSYSC 2010»
14 years 8 months ago
Constrained optimal control: an application to semiactive suspension systems
This paper applies three different control techniques to the design of a quarter car semiactive suspension system. The three techniques, originally developed to solve a constrain...
Tina Paschedag, Alessandro Giua, Carla Seatzu
GRID
2006
Springer
14 years 9 months ago
A Parallel Approach to XML Parsing
A language for semi-structured documents, XML has emerged as the core of the web services architecture, and is playing crucial roles in messaging systems, databases, and document p...
Wei Lu, Kenneth Chiu, Yinfei Pan
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng