498 search results - page 93 / 100 » Estimating Robust Query Models with Convex Optimization |
90
Voted
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
AIPS
2009
14 years 10 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
116
click to vote
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Kernel-based trackers aggregate image features within the support of a kernel (a mask) regardless of their spatial structure. These trackers spatially fit the kernel (usually in l...