Sciweavers

455 search results - page 90 / 91
» On Trees and Noncrossing Partitions
Sort
View
CASCON
2004
129views Education» more  CASCON 2004»
13 years 6 months ago
Building predictors from vertically distributed data
Due in part to the large volume of data available today, but more importantly to privacy concerns, data are often distributed across institutional, geographical and organizational...
Sabine M. McConnell, David B. Skillicorn
BMCBI
2007
135views more  BMCBI 2007»
13 years 5 months ago
RECOVIR: An application package to automatically identify some single stranded RNA viruses using capsid protein residues that un
Background: Most single stranded RNA (ssRNA) viruses mutate rapidly to generate large number of strains having highly divergent capsid sequences. Accurate strain recognition in un...
Dianhui Zhu, George E. Fox, Sugoto Chakravarty
BMCBI
2008
96views more  BMCBI 2008»
13 years 5 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
KAIS
2006
247views more  KAIS 2006»
13 years 5 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
PAMI
2008
152views more  PAMI 2008»
13 years 5 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet