Sciweavers

2040 search results - page 316 / 408
» Approximate Expectation Maximization
Sort
View
148
Voted
PR
2008
170views more  PR 2008»
15 years 2 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
INFOCOM
2010
IEEE
15 years 1 months ago
Delay Analysis for Cognitive Radio Networks with Random Access: A Fluid Queue View
Abstract—We consider a cognitive radio network where multiple secondary users (SUs) contend for spectrum usage, using random access, over available primary user (PU) channels. Ou...
Shanshan Wang, Junshan Zhang, Lang Tong
JSW
2010
83views more  JSW 2010»
15 years 1 months ago
Estimating Model Parameters of Conditioned Soils by using Artificial Network
—The parameter identification of nonlinear constitutive model of soil mass is based on an inverse analysis procedure, which consists of minimizing the objective function represen...
Zichang Shangguan, Shouju Li, Wei Sun, Maotian Lua...
MANSCI
2010
104views more  MANSCI 2010»
15 years 1 months ago
Valuing Money and Things: Why a $20 Item Can Be Worth More and Less Than $20
The study of risky decision-making has long used monetary gambles to study choice, but many everyday decisions do not involve the prospect of winning or losing money. Monetary gam...
A. Peter McGraw, Eldar Shafir, Alexander Todorov
NETWORKS
2010
15 years 1 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...