Sciweavers

13383 search results - page 2475 / 2677
» Abstractions from proofs
Sort
View
RECOMB
2001
Springer
14 years 11 months ago
Finding motifs using random projections
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...
Jeremy Buhler, Martin Tompa
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 11 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 11 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
OSDI
2008
ACM
14 years 11 months ago
Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
Xu Chen, Ming Zhang, Zhuoqing Morley Mao, Paramvir...
VLDB
2003
ACM
125views Database» more  VLDB 2003»
14 years 11 months ago
THESUS: Organizing Web document collections based on link semantics
Abstract. The requirements for effective search and management of the WWW are stronger than ever. Currently Web documents are classified based on their content not taking into acco...
Maria Halkidi, Benjamin Nguyen, Iraklis Varlamis, ...
« Prev « First page 2475 / 2677 Last » Next »