5100 search results - page 722 / 1020 » The Linear Complexity of a Graph |
169
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
189
click to vote
MDM
2009
Springer
16 years 1 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
148
click to vote
ICMCS
2007
IEEE
16 years 28 days ago
2007
IEEE
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
187
click to vote
ICCSA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
172
click to vote
ISSRE
2006
IEEE
16 years 19 days ago
2006
IEEE
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...