Sciweavers

2260 search results - page 369 / 452
» A new algorithm for clustering search results
Sort
View
BMCBI
2010
101views more  BMCBI 2010»
14 years 12 months ago
Enrichment of homologs in insignificant BLAST hits by co-complex network alignment
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
Like Fokkens, Sandra M. C. Botelho, Jos Boekhorst,...
CIKM
2011
Springer
13 years 11 months ago
Building directories for social tagging systems
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
Denis Helic, Markus Strohmaier
INFOSCALE
2007
ACM
15 years 1 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
ECCV
2008
Springer
16 years 1 months ago
GeoS: Geodesic Image Segmentation
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
Antonio Criminisi, Toby Sharp, Andrew Blake
UAI
1993
15 years 1 months ago
Using Causal Information and Local Measures to Learn Bayesian Networks
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL ...
Wai Lam, Fahiem Bacchus