Sciweavers

843 search results - page 157 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
JSW
2010
83views more  JSW 2010»
13 years 5 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...
TRANSCI
2010
128views more  TRANSCI 2010»
13 years 5 months ago
An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
Xuesong Zhou, George F. List
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
ICCV
2011
IEEE
12 years 7 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...