Sciweavers

691 search results - page 114 / 139
» Non-negative graph embedding
Sort
View
PR
2007
88views more  PR 2007»
13 years 7 months ago
Robust kernel Isomap
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
Heeyoul Choi, Seungjin Choi
INTERNET
2010
283views more  INTERNET 2010»
13 years 6 months ago
Querying the Data Web: The MashQL Approach
 We propose a query formulation language, called MashQL for querying and mashing up structured data on the web. The novelty of  MashQL is that it does not requireÂ...
Mustafa Jarrar, Marios D. Dikaiakos
3DOR
2009
13 years 5 months ago
SkelTre - Fast Skeletonisation for Imperfect Point Cloud Data of Botanic Trees
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...
Alexander Bucksch, Roderik C. Lindenbergh, Massimo...
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
MM
2004
ACM
195views Multimedia» more  MM 2004»
14 years 1 months ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...