Sciweavers

306 search results - page 60 / 62
» Underspecified computation of normal forms
Sort
View
CCS
2000
ACM
13 years 11 months ago
PRUNES: an efficient and complete strategy for automated trust negotiation over the Internet
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
Ting Yu, Xiaosong Ma, Marianne Winslett
CSC
2008
13 years 9 months ago
The Dirichlet problem for the Laplace equation in a starlike domain
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
Diego Caratelli, Paolo Emilio Ricci
EACL
2003
ACL Anthology
13 years 9 months ago
NLP for Indexing and Retrieval of Captioned Photographs
We present a text-based approach for the automatic indexing and retrieval of digital photographs taken at crime scenes. Our research prototype, SOCIS, goes beyond keyword-based ap...
Horacio Saggion, Katerina Pastra, Yorick Wilks
VMV
2003
174views Visualization» more  VMV 2003»
13 years 8 months ago
Interactive Visualization of Large Finite Element Models
198 Triangles Std. Wire Frame 2 Triangles 32×32 Texture Finite element models used in crash worthiness simulations now contain more than one million mostly quadrilateral elements...
Dirc Rose, Thomas Ertl
APAL
2010
115views more  APAL 2010»
13 years 7 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev