Sciweavers

2899 search results - page 130 / 580
» Dynamic Trees in Practice
Sort
View
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...
ACL
2010
13 years 7 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
ACNS
2007
Springer
94views Cryptology» more  ACNS 2007»
14 years 3 months ago
Preventing Collusion Attacks on the One-Way Function Tree (OFT) Scheme
The one-way function tree (OFT) scheme proposed by Balenson et. al is widely regarded as an efficient key management solution for multicast communication in large dynamic groups. ...
Xuxin Xu, Lingyu Wang, Amr M. Youssef, Bo Zhu
SAC
2005
ACM
14 years 3 months ago
Indexing continuously changing data with mean-variance tree
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
Yuni Xia, Sunil Prabhakar, Shan Lei, Reynold Cheng...
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 2 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...