Sciweavers

19700 search results - page 3916 / 3940
» DNA-Based Computation Times
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 7 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
DC
2010
13 years 7 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
CSCW
2008
ACM
13 years 7 months ago
Context-linked virtual assistants for distributed teams: an astrophysics case study
There is a growing need for distributed teams to analyze complex and dynamic data streams and make critical decisions under time pressure. Via a case study, we discuss potential g...
Sarah S. Poon, Rollin C. Thomas, Cecilia R. Aragon...
CVIU
2008
296views more  CVIU 2008»
13 years 7 months ago
Image segmentation evaluation: A survey of unsupervised methods
Image segmentation is an important processing step in many image, video and computer vision applications. Extensive research has been done in creating many different approaches an...
Hui Zhang, Jason E. Fritts, Sally A. Goldman
« Prev « First page 3916 / 3940 Last » Next »