70 search results - page 14 / 14 » An Undecidable Linear Order That Is n-Decidable for All n |
KDD
2004
ACM
14 years 6 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
SENSYS
2006
ACM
13 years 11 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
FOCS
2009
IEEE
13 years 9 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
AOSD
2009
ACM
13 years 8 months ago
2009
ACM
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
NA
2007
13 years 5 months ago
2007
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...