Sciweavers

1147 search results - page 166 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
ML
2010
ACM
163views Machine Learning» more  ML 2010»
13 years 2 months ago
Classification with guaranteed probability of error
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
Marco C. Campi
INFOCOM
2000
IEEE
14 years 3 days ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 1 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICASSP
2011
IEEE
12 years 11 months ago
On optimal channel training for uplink network MIMO systems
We study a multi-cell frequency-selective fading uplink channel from K user terminals (UTs) to B base stations (BSs). The BSs, assumed to be oblivious of the applied encoding sche...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
ICFP
2004
ACM
14 years 7 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard