1552 search results - page 122 / 311 » On the Complexity of Constant Propagation |
267
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
224
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
164
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
168
click to vote
STOC
2006
ACM
16 years 11 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
168
click to vote
ICSM
2005
IEEE
16 years 20 hour ago
2005
IEEE
As size and complexity of software systems increase, preserving the design and specification of their implementation structure gains importance in order to maintain the evolvabil...