Sciweavers

1941 search results - page 60 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CSCW
2011
ACM
14 years 6 months ago
"Not my bug!" and other reasons for software bug report reassignments
Bug reporting/fixing is an important social part of the software development process. The bug-fixing process inherently has strong inter-personal dynamics at play, especially in h...
Philip J. Guo, Thomas Zimmermann, Nachiappan Nagap...
IMC
2010
ACM
14 years 9 months ago
On the characteristics and reasons of long-lived internet flows
Prior studies of Internet traffic have considered traffic at different resolutions and time scales: packets and flows for hours or days, aggregate packet statistics for days or we...
Lin Quan, John Heidemann
KR
1992
Springer
15 years 3 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
ICIP
2003
IEEE
16 years 1 months ago
Approximation of color characterization MLUTS with artificial neural networks
MLUTs used in color characterization require significant memory for embedded systems. Most tools that create device characterization maps, use MLUTs. For this reason, there is int...
Michael J. Vrhel
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 5 days ago
Lattice problems and norm embeddings
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
Oded Regev, Ricky Rosen