Sciweavers

831 search results - page 55 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
BMCBI
2007
165views more  BMCBI 2007»
13 years 10 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 10 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
JCIT
2008
138views more  JCIT 2008»
13 years 10 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
WWW
2009
ACM
14 years 11 months ago
A declarative framework for semantic link discovery over relational data
In this paper, we present a framework for online discovery of semantic links from relational data. Our framework is based on declarative specification of the linkage requirements ...
Oktie Hassanzadeh, Lipyeow Lim, Anastasios Kements...
NSDI
2010
13 years 11 months ago
Cheap and Large CAMs for High Performance Data-Intensive Networked Systems
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
Ashok Anand, Chitra Muthukrishnan, Steven Kappes, ...