Sciweavers

46 search results - page 1 / 10
» Complexity measurement of fundamental pseudo-independent mod...
Sort
View
IJAR
2007
96views more  IJAR 2007»
13 years 4 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
JMLR
2010
119views more  JMLR 2010»
12 years 11 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
IEE
2002
92views more  IEE 2002»
13 years 4 months ago
Comparison of Web size measures for predicting Web design and authoring effort
: Software practitioners recognise the importance of realistic estimates of effort for the successful management of software projects, the Web being no exception. Estimates are nec...
Emilia Mendes, Nile Mosley, Steve Counsell
ECUMN
2007
Springer
13 years 11 months ago
Measuring and Profiling IP Traffic
Measurement of network traffic is a fundamental issue to manage the network itself. The highly selfsimilar nature of IP traffic makes its measurement and profiling a very complex ...
Nuno M. Garcia, Paulo P. Monteiro, Mário M....
ALGOSENSORS
2008
Springer
13 years 7 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri