Sciweavers

241 search results - page 39 / 49
» Four Paths to AI
Sort
View
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
13 years 8 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
CONCUR
2010
Springer
13 years 8 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
ICASSP
2010
IEEE
13 years 7 months ago
Enhanced trellis based vector quantization for coordinated beamforming
This paper presents two techniques to boost the quantization performance of trelli-based beamforming vector quantization schemes [?], [?]. It is well known that tail-biting trelli...
Chun Kin Au-Yeung, Shahab Sanayei
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 7 months ago
Information Theoretic Operating Regimes of Large Wireless Networks
In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes-bandwidth- and power-limited--have proven indispensable in the design...
Ayfer Özgür, Ramesh Johari, David N. C. ...
IAJIT
2006
109views more  IAJIT 2006»
13 years 7 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...