2600 search results - page 103 / 520 » Clustering with or without the Approximation |
124
click to vote
ESWS
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
113
Voted
JCSS
2011
14 years 8 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
117
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
125
click to vote
DAS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We propose an approach for efficient word retrieval from printed documents belonging to Digital Libraries. The approach combines word image clustering (based on Self Orga...
95
Voted
VISAPP
2008
15 years 3 months ago
2008
Abstract. This article describes an algorithm for pose or motion estimation based on clustering of parameters in the six-dimensional pose space. The parameter samples are computed ...