Sciweavers

257 search results - page 2 / 52
» Learning Unions of Tree Patterns Using Queries
Sort
View
BSN
2011
IEEE
233views Sensor Networks» more  BSN 2011»
12 years 4 months ago
Compressive Sensing of Neural Action Potentials Using a Learned Union of Supports
—Wireless neural recording systems are subject to stringent power consumption constraints to support long-term recordings and to allow for implantation inside the brain. In this ...
Zainul Charbiwala, Vaibhav Karkare, Sarah Gibson, ...
COLT
1999
Springer
13 years 9 months ago
Exact Learning of Unordered Tree Patterns from Queries
Thomas R. Amoth, Paul Cull, Prasad Tadepalli
ADC
2006
Springer
119views Database» more  ADC 2006»
13 years 8 months ago
Using reflection for querying XML documents
XML-based databases have become a major area of in database research. Abstractly speaking they can be considered as a resurrection of complexvalue databases using constructors for...
Markus Kirchberg, Faizal Riaz-ud-Din, Klaus-Dieter...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 4 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
WAIM
2009
Springer
13 years 11 months ago
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
Junhu Wang, Kewen Wang, Jiuyong Li