Sciweavers

4926 search results - page 500 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
INFOCOM
2012
IEEE
13 years 6 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
ICCV
2007
IEEE
16 years 5 months ago
Learning Higher-order Transition Models in Medium-scale Camera Networks
We present a Bayesian framework for learning higherorder transition models in video surveillance networks. Such higher-order models describe object movement between cameras in the...
Ryan Farrell, David S. Doermann, Larry S. Davis
CERA
2010
146views more  CERA 2010»
15 years 3 months ago
A Framework of Describing and Managing Engineering Analysis Modeling Knowledge for Design Validation
Engineering design is validated by engineering analysis. In the process for predicting the physical behavior of the design, the design components, physical mechanisms, etc. are id...
Yutaka Nomaguchi, Tomohiro Taguchi, Kikuo Fujita
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
15 years 2 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
AAAI
2008
15 years 4 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor