Sciweavers

110 search results - page 21 / 22
» A Real Generalization of Discrete AdaBoost
Sort
View
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
14 years 5 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
DCC
2007
IEEE
14 years 5 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
FPGA
2009
ACM
200views FPGA» more  FPGA 2009»
14 years 16 days ago
FPGA-based front-end electronics for positron emission tomography
Modern Field Programmable Gate Arrays (FPGAs) are capable of performing complex discrete signal processing algorithms with clock rates above 100MHz. This combined with FPGA’s lo...
Michael Haselman, Robert Miyaoka, Thomas K. Lewell...
EMSOFT
2007
Springer
13 years 12 months ago
WCET estimation for executables in the presence of data caches
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
Rathijit Sen, Y. N. Srikant
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
13 years 11 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader