Sciweavers

373 search results - page 17 / 75
» Counting in Trees for Free
Sort
View
TMC
2010
224views more  TMC 2010»
13 years 7 months ago
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
Qingjun Xiao, Bin Xiao, Jiannong Cao, Jianping Wan...
ACL
1998
13 years 10 months ago
An Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
Rebecca Hwa
EMNLP
2008
13 years 10 months ago
A Dependency-based Word Subsequence Kernel
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
Rohit J. Kate
IJAC
2007
89views more  IJAC 2007»
13 years 8 months ago
Bounding Right-Arm Rotation Distances
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
Sean Cleary, Jennifer Taback
DOCENG
2009
ACM
14 years 3 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...