There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
We present a statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs. Earlier statistical algorithms that focus solely on identifying p...
Ben Liblit, Mayur Naik, Alice X. Zheng, Alexander ...
Most recent schema matching systems assemble multiple components, each employing a particular matching technique. The domain user must then tune the system: select the right compo...
Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
This paper connects two research areas: automatic tagging on the web and statistical keyphrase extraction. First, we analyze the quality of tags in a collaboratively created folks...