Sciweavers

2466 search results - page 142 / 494
» Algorithms for distributed functional monitoring
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 6 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
NIPS
1998
15 years 8 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
WSNA
2003
ACM
16 years 14 hour ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
CORR
2011
Springer
183views Education» more  CORR 2011»
15 years 1 months ago
Detecting Separation in Robotic and Sensor Networks
In this paper we consider the problem of monitoring detecting separation of agents from a base station in robotic and sensor networks. Such separation can be caused by mobility an...
Chenda Liao, Harshavardhan Chenji, Prabir Barooah,...
BMCBI
2005
115views more  BMCBI 2005»
15 years 6 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...