Sciweavers

4112 search results - page 475 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
EDBT
2002
ACM
136views Database» more  EDBT 2002»
16 years 7 months ago
The Geometry of Uncertainty in Moving Objects Databases
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
Goce Trajcevski, Ouri Wolfson, Fengli Zhang, Sam C...
HASE
2008
IEEE
16 years 2 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
16 years 1 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...
ICDE
2007
IEEE
146views Database» more  ICDE 2007»
15 years 11 months ago
Index-based Most Similar Trajectory Search
The problem of trajectory similarity in moving object databases is a relatively new topic in the spatial and spatiotemporal database literature. Existing work focuses on the spati...
Elias Frentzos, Kostas Gratsias, Yannis Theodoridi...
HT
1991
ACM
15 years 11 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold