Sciweavers

459 search results - page 83 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
IPSN
2005
Springer
15 years 5 months ago
Lazy inference on object identities in wireless sensor networks
Tracking the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic difficulty of ...
Jaewon Shin, Nelson Lee, Sebastian Thrun, Leonidas...
92
Voted
ATAL
2008
Springer
15 years 1 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
ALMOB
2006
110views more  ALMOB 2006»
14 years 11 months ago
New journal: Algorithms for Molecular Biology
This editorial announces Algorithms for Molecular Biology, a new online open access journal published by BioMed Central. By launching the first open access journal on algorithmic ...
Burkhard Morgenstern, Peter F. Stadler
JSC
2010
155views more  JSC 2010»
14 years 10 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
SIGIR
2009
ACM
15 years 6 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...