Sciweavers

941 search results - page 89 / 189
» Efficient Testing of Large Graphs
Sort
View
GPCE
2007
Springer
15 years 1 months ago
Library composition and adaptation using c++ concepts
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
Jaakko Järvi, Matthew A. Marcus, Jacob N. Smi...
76
Voted
WWW
2005
ACM
15 years 10 months ago
Incremental page rank computation on evolving graphs
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
Prasanna Kumar Desikan, Nishith Pathak, Jaideep Sr...
BMCBI
2008
211views more  BMCBI 2008»
14 years 10 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
NIPS
2004
14 years 11 months ago
Contextual Models for Object Detection Using Boosted Random Fields
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
Antonio Torralba, Kevin P. Murphy, William T. Free...
AIPS
2009
14 years 11 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden