2996 search results - page 151 / 600 » Information Modeling in the Time of the Revolution |
157
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
142
click to vote
EJWCN
2010
15 years 1 months ago
2010
Model checking (MC) is a formal verification technique which has known and still knows a resounding success in the computer science community. Realizing that the distributed power...
152
click to vote
IPPS
2005
IEEE
16 years 3 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
308
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Existing prediction methods in moving objects databases cannot forecast locations accurately if the query time is far away from the current time. Even for near future prediction, m...
165
click to vote
SC
2005
ACM
16 years 2 days ago
2005
ACM
The availability of inexpensive “off the shelf” machines increases the likelihood that parallel programs run on heterogeneous clusters of machines. These programs are increasi...