Sciweavers

4095 search results - page 342 / 819
» How to test a tree
Sort
View
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
15 years 3 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
154
Voted
ACL
2010
15 years 3 months ago
Importance of Linguistic Constraints in Statistical Dependency Parsing
Statistical systems with high accuracy are very useful in real-world applications. If these systems can capture basic linguistic information, then the usefulness of these statisti...
Bharat Ram Ambati
NAACL
2010
15 years 3 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
ICN
2009
Springer
15 years 3 months ago
Implicit Media Knowledge
Implicit Media Knowledge aims to provide relevant information related to visual media without effort. It is based on the analysis of media usage from several users (e.g. a communit...
Muy-Chu Ly, Alexis Germaneau, Olivier Martinot
149
Voted
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
15 years 3 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...