Sciweavers

6562 search results - page 1147 / 1313
» Noetherianity and Combination Problems
Sort
View
RECOMB
2006
Springer
16 years 6 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
RECOMB
2004
Springer
16 years 6 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 6 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
VLDB
2007
ACM
104views Database» more  VLDB 2007»
16 years 6 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 6 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
« Prev « First page 1147 / 1313 Last » Next »