Sciweavers

8540 search results - page 1369 / 1708
» The Dynamic Servers Problem
Sort
View
WECWIS
2003
IEEE
205views ECommerce» more  WECWIS 2003»
15 years 10 months ago
Beyond "web of trust": Enabling P2P E-commerce
The huge success of eBay has proven the demand for customer-to-customer (C2C) electronic commerce. eBay is a centralized infrastructure with all its scalability problems (network ...
Anwitaman Datta, Manfred Hauswirth, Karl Aberer
IANDC
2008
141views more  IANDC 2008»
15 years 4 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
BMCBI
2007
127views more  BMCBI 2007»
15 years 4 months ago
Predicting the phenotypic effects of non-synonymous single nucleotide polymorphisms based on support vector machines
Background: Human genetic variations primarily result from single nucleotide polymorphisms (SNPs) that occur approximately every 1000 bases in the overall human population. The no...
Jian Tian, Ningfeng Wu, Xuexia Guo, Jun Guo, Juhua...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 7 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
DAC
2005
ACM
16 years 5 months ago
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design
As the d esig n-m anu factu ring interface becom es increasing ly com plicated with IC technolog y scaling , the correspond ing process variability poses g reat challeng es for na...
Yang Xu, Kan-Lin Hsiung, Xin Li, Ivan Nausieda, St...
« Prev « First page 1369 / 1708 Last » Next »