Sciweavers

77 search results - page 14 / 16
» Restricted domination parameters in graphs
Sort
View
IJHPCA
2006
117views more  IJHPCA 2006»
13 years 8 months ago
Recent Developments in Gridsolve
The purpose of GridSolve is to create the middleware necessary to provide a seamless bridge between the simple, standard programming interfaces and desktop systems that dominate t...
Asim YarKhan, Keith Seymour, Kiran Sagi, Zhiao Shi...
FOCS
2007
IEEE
14 years 2 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav
FSTTCS
2010
Springer
13 years 6 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
ACL
2009
13 years 6 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
CP
2000
Springer
14 years 26 days ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa