Sciweavers

854 search results - page 94 / 171
» Abstracting from Failure Probabilities
Sort
View
SSS
2005
Springer
132views Control Systems» more  SSS 2005»
15 years 10 months ago
Self-stabilizing Mobile Node Location Management and Message Routing
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and sto...
Shlomi Dolev, Limor Lahiani, Nancy A. Lynch, Tina ...
LREC
2010
169views Education» more  LREC 2010»
15 years 6 months ago
Using Comparable Corpora to Adapt a Translation Model to Domains
Statistical machine translation (SMT) requires a large parallel corpus, which is available only for restricted language pairs and domains. To expand the language pairs and domains...
Hiroyuki Kaji, Takashi Tsunakawa, Daisuke Okada
152
Voted
NIPS
2007
15 years 6 months ago
People Tracking with the Laplacian Eigenmaps Latent Variable Model
Reliably recovering 3D human pose from monocular video requires models that bias the estimates towards typical human poses and motions. We construct priors for people tracking usi...
Zhengdong Lu, Miguel Á. Carreira-Perpi&ntil...
TON
2002
75views more  TON 2002»
15 years 4 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
181
Voted
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 9 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson