Sciweavers

193 search results - page 21 / 39
» Short Bases of Lattices over Number Fields
Sort
View
WINET
2002
169views more  WINET 2002»
13 years 8 months ago
Centaurus: An Infrastructure for Service Management in Ubiquitous Computing Environments
In the near future, we will see dramatic changes in computing and networking hardware. A large number of devices (e.g., phones, PDAs, even small household appliances) will become c...
Lalana Kagal, Vlad Korolev, Sasikanth Avancha, Anu...
P2P
2008
IEEE
14 years 2 months ago
Transaction Rate Limiters for Peer-to-Peer Systems
We introduce transaction rate limiters, new mechanisms that limit (probabilistically) the maximum number of transactions a user of a peer-to-peer system can do in any given period...
Marcos Kawazoe Aguilera, Mark Lillibridge, Xiaozho...
FOSSACS
2008
Springer
13 years 10 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
ACL
1998
13 years 9 months ago
Word Association and MI-TRigger-based Language Modeling
There exists strong word association in natural language. Based on mutual information, this paper proposes a new MI-Trigger-based modeling approach to capture the preferred relati...
Guodong Zhou, Kimteng Lua
PODC
1999
ACM
14 years 22 days ago
Liveness-Preserving Simulation Relations
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
Paul C. Attie