Sciweavers

3359 search results - page 75 / 672
» A Simplified Idea Algorithm
Sort
View
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ICC
2007
IEEE
196views Communications» more  ICC 2007»
14 years 4 months ago
Opportunistic Network Coding for Wireless Networks
— We consider energy efficient network coding design in wireless networks with multiple unicast sessions. Our approach decomposes multiple unicast sessions into a superposition ...
Wei Chen, Khaled Ben Letaief, Zhigang Cao
SAT
2005
Springer
111views Hardware» more  SAT 2005»
14 years 3 months ago
On Subsumption Removal and On-the-Fly CNF Simplification
Conjunctive Normal Form (CNF) Boolean formulas generated from resolution or solution enumeration often have much redundancy. It is desirable to have an efficient algorithm to simpl...
Lintao Zhang
CSB
2004
IEEE
14 years 1 months ago
Space-Conserving Optimal DNA-Protein Alignment
DNA-protein alignment algorithms can be used to discover coding sequences in a genomic sequence, if the corresponding protein derivatives are known. They can also be used to ident...
Pang Ko, Mahesh Narayanan, Anantharaman Kalyanaram...
COLT
2008
Springer
13 years 12 months ago
Learning Rotations
An algorithm is presented for online learning of rotations. The proposed algorithm involves matrix exponentiated gradient updates and is motivated by the von Neumann divergence. T...
Adam M. Smith, Manfred K. Warmuth