Sciweavers

4757 search results - page 639 / 952
» Generalized Posynomial Performance Modeling
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ASMTA
2009
Springer
104views Mathematics» more  ASMTA 2009»
16 years 1 months ago
Preliminary Results on a Simple Approach to G/G/c-Like Queues
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
Alexandre Brandwajn, Thomas Begin
INFOCOM
2005
IEEE
16 years 6 days ago
Bayesian packet loss detection for TCP
— One of TCP’s critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implem...
Nahur Fonseca, Mark Crovella
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 11 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
PR
2006
127views more  PR 2006»
15 years 6 months ago
Unsupervised possibilistic clustering
In fuzzy clustering, the fuzzy c-means (FCM) clustering algorithm is the best known and used method. Since the FCM memberships do not always explain the degrees of belonging for t...
Miin-Shen Yang, Kuo-Lung Wu