Sciweavers

17298 search results - page 3260 / 3460
» Abstract computing machines
Sort
View
RECOMB
2001
Springer
16 years 4 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
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 4 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
250
Voted
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 4 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
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...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
16 years 4 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 4 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
« Prev « First page 3260 / 3460 Last » Next »