Sciweavers

1000 search results - page 103 / 200
» Dependency Tree Automata
Sort
View
IPM
2008
159views more  IPM 2008»
15 years 24 days ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
111
Voted
MONET
2006
103views more  MONET 2006»
15 years 23 days ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
EDOC
2009
IEEE
15 years 4 months ago
Monitoring and Analyzing Influential Factors of Business Process Performance
Abstract--Business activity monitoring enables continuous observation of key performance indicators (KPIs). However, if things go wrong, a deeper analysis of process performance be...
Branimir Wetzstein, Philipp Leitner, Florian Rosen...
ESOP
2008
Springer
15 years 2 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
78
Voted
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 17 days ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...