Sciweavers

2950 search results - page 186 / 590
» Computing with Infinitely Many Processes
Sort
View
DOCENG
2009
ACM
15 years 4 months ago
Geometric consistency checking for local-descriptor based document retrieval
In this paper, we evaluate different geometric consistency schemes, which can be used in tandem with an efficient architecture, based on voting and local descriptors, to retrieve ...
Eduardo Valle, David Picard, Matthieu Cord
ICSE
2004
IEEE-ACM
16 years 6 months ago
Skoll: Distributed Continuous Quality Assurance
Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. ...
Atif M. Memon, Adam A. Porter, Cemal Yilmaz, Adith...
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
15 years 4 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
POST
2012
218views more  POST 2012»
14 years 1 months ago
A Core Calculus for Provenance
Provenance is an increasing concern due to the revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer sys...
Umut A. Acar, Amal Ahmed, James Cheney, Roly Perer...
RECOMB
2012
Springer
13 years 8 months ago
Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
Nurcan Tuncbag, Alfredo Braunstein, Andrea Pagnani...