Sciweavers

206 search results - page 27 / 42
» Deterministic Caterpillar Expressions
Sort
View
SIGMOD
2011
ACM
199views Database» more  SIGMOD 2011»
13 years 20 days ago
Schema-as-you-go: on probabilistic tagging and querying of wide tables
The emergence of Web 2.0 has resulted in a huge amount of heterogeneous data that are contributed by a large number of users, engendering new challenges for data management and qu...
Meiyu Lu, Divyakant Agrawal, Bing Tian Dai, Anthon...
CONCUR
2004
Springer
14 years 3 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
ENTCS
1998
105views more  ENTCS 1998»
13 years 9 months ago
A Concurrent Object Calculus: Reduction and Typing
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
Andrew D. Gordon, Paul D. Hankin
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 9 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 4 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena