15073 search results - page 159 / 3015 » Probabilistic algorithms for computing resultants |
132
Voted
ARTS
1999
Springer
15 years 8 months ago
1999
Springer
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
140
Voted
NCA
2005
IEEE
15 years 9 months ago
2005
IEEE
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
140
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
121
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
138
Voted
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
— An important problem in robotics is planning and selecting actions for goal-directed behavior in noisy uncertain environments. The problem is typically addressed within the fra...