14078 search results - page 1945 / 2816 » Design and Analysis of Computer Algorithms |
265
Voted
RECOMB
2001
Springer
16 years 8 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
197
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
205
Voted
PG
2003
IEEE
16 years 28 days ago
2003
IEEE
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
263
Voted
PODC
2012
ACM
13 years 10 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
313
Voted
GIS
2005
ACM
16 years 8 months ago
2005
ACM
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...