Sciweavers

3341 search results - page 500 / 669
» On Bounded Queries and Approximation
Sort
View
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
16 years 1 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
VLDB
2007
ACM
115views Database» more  VLDB 2007»
16 years 18 days ago
The Boundary Between Privacy and Utility in Data Publishing
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
Vibhor Rastogi, Sungho Hong, Dan Suciu
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
16 years 18 days ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
IPSN
2005
Springer
16 years 10 hour ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
HAPTICS
2002
IEEE
15 years 11 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...