12981 search results - page 2500 / 2597 » Model Checking and Abstraction |
117
click to vote
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
109
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
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...
112
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
223
click to vote
VLDB
2006
ACM
16 years 1 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
189
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
This paper presents HomeViews, a peer-to-peer middleware system for building personal data management applications. HomeViews provides abstractions and services for data organizat...