Sciweavers

1963 search results - page 301 / 393
» The Maximum Solution Problem on Graphs
Sort
View
IPPS
2005
IEEE
14 years 3 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
CP
2000
Springer
14 years 2 months 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
ACL
1993
13 years 11 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 10 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 10 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...