8695 search results - page 1435 / 1739 » Making the Complex Simple |
133
Voted
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Many of today's Web applications support just simple trial-anderror retrievals: supply one set of parameters, obtain one set of results. For a user who wants to examine a num...
123
click to vote
WWW
2001
ACM
16 years 4 months ago
2001
ACM
We discuss the problem of Web data extraction and describe an XML-based methodology whose goal extends far beyond simple "screen scraping." An ideal data extraction proc...
247
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
146
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
144
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...