Sciweavers

530 search results - page 22 / 106
» Universal randomized switching
Sort
View
ICCD
2004
IEEE
148views Hardware» more  ICCD 2004»
15 years 10 months ago
Many-to-Many Core-Switch Mapping in 2-D Mesh NoC Architectures
In this paper, we investigate the core-switch mapping(CSM) problem that optimally maps cores onto an NoC architecture such that either the energy consumption or the congestion is ...
Chan-Eun Rhee, Han-You Jeong, Soonhoi Ha
ALGOSENSORS
2007
Springer
15 years 8 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
CVPR
2009
IEEE
16 years 9 months ago
Increased Discrimination in Level Set Methods with Embedded Conditional Random Fields
We propose a novel approach for improving level set seg- mentation methods by embedding the potential functions from a discriminatively trained conditional random field (CRF) in...
Dana Cobzas (University of Alberta), Mark Schmidt ...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 2 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
ICN
2005
Springer
15 years 7 months ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos