Sciweavers

2497 search results - page 178 / 500
» Requirements for models of achievable routing
Sort
View
COMPULOG
1999
Springer
15 years 10 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
CVPR
2008
IEEE
16 years 8 months ago
Who killed the directed model?
Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these p...
Justin Domke, Alap Karapurkar, Yiannis Aloimonos
INTERSPEECH
2010
15 years 1 months ago
Within and across sentence boundary language model
In this paper, we propose two different language modeling approaches, namely skip trigram and across sentence boundary, to capture the long range dependencies. The skip trigram mo...
Saeedeh Momtazi, Friedrich Faubel, Dietrich Klakow
WSCG
2000
100views more  WSCG 2000»
15 years 7 months ago
Adaptive Visualization for Interactive Geometric Modeling in Geoscience
Many engineering disciplines can profitably use large high-resolution geometric models whose computational requirements exceed current computer hardware capacities. This paper pre...
HongQian Karen Lu, Richard Hammersley
ACSAC
2004
IEEE
15 years 10 months ago
High-Fidelity Modeling of Computer Network Worms
modeling, such as using epidemic models, has been the general method of choice for understanding and analyzing the high-level effects of worms. However, high-fidelity models, such...
Kalyan S. Perumalla, Srikanth Sundaragopalan