1597 search results - page 155 / 320 » Project Improvement as Start-Up |
147
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
147
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
In a software development group of IBM Retail Store Solutions, we built a non-trivial software system based on a stable standard specification using a disciplined, rigorous unit t...
181
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
165
click to vote
ECBS
2009
IEEE
16 years 1 months ago
2009
IEEE
Software systems have to be changed continuously and evolutionarily throughout the whole time of their development and usage. Meanwhile, the software systems have to remain flexi...
154
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
The evolution of Web sites towards very dynamic applications makes it necessary to reconsider current Web programming technologies. We believe that Web development would benefit ...