756 search results - page 54 / 152 » Recent progress with BOXES |
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
APWEB
2005
Springer
14 years 12 months ago
2005
Springer
In this paper, we will provide an overview of some of the more recent developments in web graph processing using the classic Google page rank equation as popularized by Brins and P...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
AAAI
2010
14 years 11 months ago
2010
Automatically constructing novel representations of tasks from analysis of state spaces is a longstanding fundamental challenge in AI. I review recent progress on this problem for...
109
click to vote
FECS
2008
14 years 11 months ago
2008
Teaching software modeling and software design presents a different and difficult set of problems than teaching some of the other aspects of software engineering such as testing a...