Sciweavers

5183 search results - page 323 / 1037
» The Complexity of Distributions
Sort
View
EDOC
2004
IEEE
15 years 10 months ago
Using Subject-Oriented Modeling to Develop Jini Applications
A major contributing factor to the complexity of creating and evolving distributed systems is the tangling of middleware-specific functionality with core business functionality in...
Gagan Tandon, Sudipto Ghosh
DCC
2004
IEEE
15 years 10 months ago
Joint Source-Channel Decoding of Quasi-Arithmetic Codes
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
Thomas Guionnet, Christine Guillemot
IPPS
2007
IEEE
16 years 29 days ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 19 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
COLT
1994
Springer
15 years 10 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby