Sciweavers

8322 search results - page 96 / 1665
» What Are We Looking for
Sort
View
AUSAI
2008
Springer
14 years 1 days ago
Exploiting Ontological Structure for Complex Preference Assembly
When a user is looking for a product recommendation they usually lack expert knowledge regarding the items they are looking for. Ontologies on the other hand are crafted by experts...
Gil Chamiel, Maurice Pagnucco
EUROCRYPT
2009
Springer
14 years 10 months ago
Verifiable Random Functions from Identity-Based Key Encapsulation
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
Michel Abdalla, Dario Catalano, Dario Fiore
CCGRID
2007
IEEE
14 years 4 months ago
Build-and-Test Workloads for Grid Middleware: Problem, Analysis, and Applications
The Grid promise is starting to materialize today: largescale multi-site infrastructures have grown to assist the work of scientists from all around the world. This tremendous gro...
Alexandru Iosup, Dick H. J. Epema
WSC
2007
14 years 11 days ago
Building composable bridges between the conceptual space and the implementation space
Often the process and effort in building interoperable Command and Control (C2) systems and simulations can be arduous. Invariably the difficulty is in understanding what is inten...
Paul Gustavson, Tram Chase
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
13 years 11 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta