Sciweavers

43264 search results - page 77 / 8653
» Comparing models of computation
Sort
View
ICPR
2002
IEEE
14 years 10 months ago
Probabilistic Models for Generating, Modelling and Matching Image Categories
In this paper we present a probabilistic and continuous framework for supervised image category modelling and matching as well as unsupervised clustering of image space into image...
Hayit Greenspan, Shiri Gordon, Jacob Goldberger
EACL
2009
ACL Anthology
13 years 6 months ago
MINT: A Method for Effective and Scalable Mining of Named Entity Transliterations from Large Comparable Corpora
In this paper, we address the problem of mining transliterations of Named Entities (NEs) from large comparable corpora. We leverage the empirical fact that multilingual news artic...
Raghavendra Udupa, K. Saravanan, A. Kumaran, Jagad...
PEWASUN
2007
ACM
13 years 10 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
WSC
2004
13 years 10 months ago
Comparative Factory Analysis of Standard FOUP Capacities
Wafers in a 300-mm semiconductor fabrication facility are transported throughout the factory in carriers called front opening unified pods (FOUPs). Two standard capacities of FOUP...
Kranthi Mitra Adusumilli, Robert L. Wright
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 months ago
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform ...
Ivan Lanese, Ugo Montanari