Sciweavers

5210 search results - page 853 / 1042
» Computing Capabilities of Mediators
Sort
View
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
PR
2007
96views more  PR 2007»
15 years 6 months ago
Style-preserving English handwriting synthesis
This paper presents a novel and effective approach to synthesize English handwriting in the user’s writing style. We select the most important features that depict the handwriti...
Zhouchen Lin, Liang Wan
AI
2008
Springer
15 years 5 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
ET
2010
89views more  ET 2010»
15 years 5 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
GIS
2010
ACM
15 years 5 months ago
Exploiting local node cache in top-k queries within wireless sensor networks
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...