Sciweavers

37217 search results - page 7438 / 7444
» or 2010
Sort
View
ICSE
2012
IEEE-ACM
11 years 11 months ago
Performance debugging in the large via mining millions of stack traces
—Given limited resource and time before software release, development-site testing and debugging become more and more insufficient to ensure satisfactory software performance. As...
Shi Han, Yingnong Dang, Song Ge, Dongmei Zhang, Ta...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 6 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 6 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
STACS
2010
Springer
14 years 3 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
EUROSYS
2010
ACM
14 years 2 months ago
PUSH: A Dataflow Shell
The deluge of huge data sets such as those provided by sensor networks, online transactions, and the web provide exciting opportunities for data analysis. The scale of the data ...
Noah Evans, Eric Van Hensbergen
« Prev « First page 7438 / 7444 Last » Next »