2100 search results - page 169 / 420 » Fundamentals of the problem |
NIPS
2008
15 years 2 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
110
click to vote
UAI
2008
15 years 2 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
111
click to vote
AAAI
2004
15 years 2 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
129
click to vote
APCCM
2004
15 years 2 months ago
2004
Despite the hype surrounding enterprise architectures, they have delivered little on their promise. In this paper, we argue that enterprise architectures built using component-bas...
134
click to vote
ICWS
2004
IEEE
15 years 2 months ago
2004
IEEE
The fundamental challenge of e-commerce is enabling companies to do business with one another across a network, despite different business processes and computer systems. Traditio...