Sciweavers

197 search results - page 22 / 40
» Undecidability Results for Distributed Probabilistic Systems
Sort
View
HUC
2004
Springer
15 years 7 months ago
Particle Filters for Location Estimation in Ubiquitous Computing: A Case Study
Location estimation is an important part of many ubiquitous computing systems. Particle filters are simulation-based probabilistic approximations which the robotics community has ...
Jeffrey Hightower, Gaetano Borriello
105
Voted
LREC
2008
131views Education» more  LREC 2008»
15 years 3 months ago
Learning Morphology with Morfette
Morfette is a modular, data-driven, probabilistic system which learns to perform joint morphological tagging and lemmatization from morphologically annotated corpora. The system i...
Grzegorz Chrupala, Georgiana Dinu, Josef van Genab...
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 5 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
145
Voted
AGENTS
2001
Springer
15 years 6 months ago
A fuzzy model of reputation in multi-agent systems
Agents are intended to interact in open systems where the knowledge about others (reputation) is incomplete and uncertain. Also, this knowledge about other agents is subjective si...
Javier Carbo Rubiera, José M. Molina L&oacu...
135
Voted
CCS
2010
ACM
15 years 2 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov