934 search results - page 179 / 187 » A theoretical analysis of the HIFF problem |
141
click to vote
VLDB
2008
ACM
15 years 11 months ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
188
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
106
click to vote
MOBIHOC
2008
ACM
15 years 10 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
ICRA
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...