1093 search results - page 138 / 219 » Clustering from Constraint Graphs |
108
Voted
DIAL
2006
IEEE
15 years 9 months ago
2006
IEEE
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...
125
Voted
WSCG
2004
15 years 5 months ago
2004
This paper is about the visualization of positive data subject to positivity constraint. It presents an algorithm that produces a non-negative graph through scattered positive dat...
134
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
130
click to vote
CLUSTER
2003
IEEE
15 years 9 months ago
2003
IEEE
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
134
Voted
AAMAS
2002
Springer
15 years 3 months ago
2002
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support eff...