Sciweavers

3941 search results - page 210 / 789
» Computational Efficiency of Batching Methods
Sort
View
109
Voted
ACL
2006
15 years 5 months ago
Sub-Sentential Alignment Using Substring Co-Occurrence Counts
In this paper, we will present an efficient method to compute the co-occurrence counts of any pair of substring in a parallel corpus, and an algorithm that make use of these count...
Fabien Cromierès
108
Voted
TSMC
2008
127views more  TSMC 2008»
15 years 4 months ago
Sensor Placement for Fault Diagnosis
An algorithm is developed for computing which sensors to add to obtain maximum fault detectability and fault isolability. The method is based on only the structural information in...
Mattias Krysander, Erik Frisk
98
Voted
ICIP
2009
IEEE
16 years 5 months ago
An Efficient Bayesian Framework For On-line Action Recognition
On-line action recognition from a continuous stream of actions is still an open problem with fewer solutions proposed compared to time-segmented action recognition. The most chall...
ICML
2007
IEEE
16 years 5 months ago
Percentile optimization in uncertain Markov decision processes with application to efficient exploration
Markov decision processes are an effective tool in modeling decision-making in uncertain dynamic environments. Since the parameters of these models are typically estimated from da...
Erick Delage, Shie Mannor
PERCOM
2005
ACM
16 years 3 months ago
Maneuverable Relays to Improve Energy Efficiency in Sensor Networks
We propose a hybrid model to alleviate the notorious problem of premature battery depletion in sensor networks: in a first stage, simple sensors are deployed over an area of inter...
Stephan Eidenbenz, Lukas Kroc, James P. Smith