Sciweavers

1147 search results - page 197 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
BMCBI
2007
127views more  BMCBI 2007»
13 years 7 months ago
The EIPeptiDi tool: enhancing peptide discovery in ICAT-based LC MS/MS experiments
Background: Isotope-coded affinity tags (ICAT) is a method for quantitative proteomics based on differential isotopic labeling, sample digestion and mass spectrometry (MS). The me...
Mario Cannataro, Giovanni Cuda, Marco Gaspari, Ser...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Time-bounded adaptation for automotive system software
Software is increasingly deployed in vehicles as demand for new functionality increases and cheaper and more powerful hardware becomes available. Likewise, emerging wireless commu...
Aline Senart, Douglas C. Schmidt, Serena Fritsch, ...
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
14 years 8 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman
GLOBECOM
2009
IEEE
14 years 2 months ago
On the Connectivity of Key-Distribution Strategies in Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise a...
Hosein Shafiei, Ahmad Khonsari, Mohammad Sadegh Ta...
INFOCOM
2005
IEEE
14 years 1 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub