Sciweavers

1355 search results - page 84 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CAP
2010
13 years 4 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
INFOCOM
2002
IEEE
14 years 1 months ago
Performance of Reliable Transport Protocol over IEEE 802.11 Wireless LAN: Analysis and Enhancement
IEEE 802.11 Medium Access Control(MAC) is proposed to support asynchronous and time bounded delivery of radio data packets in infrastructure and ad hoc networks. The basis of the I...
Haitao Wu, Yong Peng, Keping Long, Shiduan Cheng, ...
EDBT
2006
ACM
136views Database» more  EDBT 2006»
14 years 9 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 1 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
CP
1997
Springer
14 years 1 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...