Sciweavers

505 search results - page 79 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
IJCM
2002
92views more  IJCM 2002»
14 years 9 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
62
Voted
VLDB
2002
ACM
116views Database» more  VLDB 2002»
14 years 9 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
81
Voted
ACL
2009
14 years 7 months ago
Insights into Non-projectivity in Hindi
Large scale efforts are underway to create dependency treebanks and parsers for Hindi and other Indian languages. Hindi, being a morphologically rich, flexible word order language...
Prashanth Mannem, Himani Chaudhry, Akshar Bharati
186
Voted
CVPR
2011
IEEE
14 years 5 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
CN
1998
67views more  CN 1998»
14 years 9 months ago
An Extensible Rendering Engine for XML
XML has been proposed in order to bring to the web a markup language free of the shortcomings of HTML, in particular the inextensibility of the set of valid elements (tags). Style...
Paolo Ciancarini, Alfredo Rizzi, Fabio Vitali