Sciweavers

2774 search results - page 298 / 555
» Exploiting Deep Structure
Sort
View
SIS
2004
15 years 8 months ago
Efficient Tree Search in Encrypted Data
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
IJCAI
2003
15 years 8 months ago
Local-Effect Games
We present a new class of games, local-effect games (LEGs), which exploit structure in a different way from other compact game representations studied in AI. We show both theoreti...
Kevin Leyton-Brown, Moshe Tennenholtz
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 8 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
VMV
2001
129views Visualization» more  VMV 2001»
15 years 8 months ago
Compression of Isosurfaces
In many applications surfaces containing a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is gi...
Dietmar Saupe, Jens-Peer Kuska
ISTA
2003
15 years 8 months ago
Querying Tourism Information Systems in Natural Language
: With the increasing amount of information available on the Internet one of the most challenging tasks is to provide search interfaces that are easy to use without having to learn...
Helmut Berger, Michael Dittenbach, Dieter Merkl