Sciweavers

1023 search results - page 118 / 205
» Graph model selection using maximum likelihood
Sort
View
IDA
2000
Springer
13 years 10 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
TR
2008
67views more  TR 2008»
13 years 10 months ago
Degradation Analysis of Nano-Contamination in Plasma Display Panels
Abstract--As an alternative to traditional life testing, degradation tests can be effective in assessing product reliability when measurements of degradation leading to failure can...
Suk Joo Bae, Seong-Joon Kim, Man Soo Kim, Bae Jin ...
MOBICOM
2012
ACM
12 years 15 days ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
NIPS
2003
13 years 11 months ago
Discriminative Fields for Modeling Spatial Dependencies in Natural Images
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
Sanjiv Kumar, Martial Hebert
TNN
1998
114views more  TNN 1998»
13 years 9 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan