Sciweavers

2192 search results - page 275 / 439
» Algorithms for Challenging Motif Problems
Sort
View
INFOCOM
2007
IEEE
15 years 10 months ago
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
Haim Zlatokrilov, Hanoch Levy
132
Voted
IPPS
2007
IEEE
15 years 10 months ago
RAxML-Cell: Parallel Phylogenetic Tree Inference on the Cell Broadband Engine
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
Filip Blagojevic, Alexandros Stamatakis, Christos ...
145
Voted
WACV
2007
IEEE
15 years 10 months ago
Localization and Mapping for Autonomous Navigation in Outdoor Terrains : A Stereo Vision Approach
We consider the problem of autonomous navigation in unstructured outdoor terrains using vision sensors. The goal is for a robot to come into a new environment, map it and move to ...
Motilal Agrawal, Kurt Konolige, Robert C. Bolles
153
Voted
CIKM
2007
Springer
15 years 10 months ago
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
Tao-Young Fu, Wen-Chih Peng, Wang-Chien Lee
CSR
2007
Springer
15 years 10 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka