Sciweavers

4491 search results - page 805 / 899
» Algorithm Engineering
Sort
View
PODC
2009
ACM
14 years 10 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
KDD
2009
ACM
219views Data Mining» more  KDD 2009»
14 years 10 months ago
Structured correspondence topic models for mining captioned figures in biological literature
A major source of information (often the most crucial and informative part) in scholarly articles from scientific journals, proceedings and books are the figures that directly pro...
Amr Ahmed, Eric P. Xing, William W. Cohen, Robert ...
KDD
2009
ACM
296views Data Mining» more  KDD 2009»
14 years 10 months ago
Anonymizing healthcare data: a case study on the blood transfusion service
: Gaining access to high-quality health data is a vital requirement to informed decision making for medical practitioners and pharmaceutical researchers. Driven by mutual benefits ...
Noman Mohammed, Benjamin C. M. Fung, Patrick C. K....
POPL
2007
ACM
14 years 9 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 9 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...