Sciweavers

1283 search results - page 45 / 257
» Probabilistic structured query methods
Sort
View
ICDE
2005
IEEE
134views Database» more  ICDE 2005»
14 years 2 months ago
Index Structures for Matching XML Twigs Using Relational Query Processors
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Kou...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 9 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
DOLAP
2005
ACM
13 years 10 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
FTCGV
2011
122views more  FTCGV 2011»
13 years 8 days ago
Structured Learning and Prediction in Computer Vision
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...
Sebastian Nowozin, Christoph H. Lampert
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 8 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell