4066 search results - page 215 / 814 » Almost Complete Sets |
134
click to vote
IRI
2007
IEEE
16 years 25 days ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
184
click to vote
CGF
2010
15 years 6 months ago
2010
Given a complete unoriented point set, we propose a binary orientation tree (BOT) for volume and surface representation, which roughly splits the space into the interior and exter...
286
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
163
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
181
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...