1986 search results - page 230 / 398 » Path Separability of Graphs |
130
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
113
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
2005
ACM
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
120
Voted
COMPSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...
108
click to vote
EUSFLAT
2003
15 years 4 months ago
2003
Functional laws may be known only at a finite number of points, and then the function can be completed by interpolation techniques obeying some smoothness conditions. We rather pr...
104
Voted
SODA
1996
ACM
15 years 3 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...