Filters








4,283 Hits in 2.0 sec

Scalable Precomputed Search Trees [chapter]

Manfred Lau, James Kuffner
2010 Lecture Notes in Computer Science  
We precompute a search tree incrementally and use a density metric to scatter the paths of the tree evenly among the region we want to build the tree in.  ...  The traditional A*-search method builds a search tree of potential solution paths during runtime.  ...  The paths in our precomputed trees are stored and analyzed for these navigation scenarios. SPST Scalable Precomputed Search Trees (SPST) is a fully-developed system of the idea of precomputation.  ... 
doi:10.1007/978-3-642-16958-8_8 fatcat:u7kzlmvh75fnjhhil4p2kwmr3i

Scaling link-based similarity search

Dániel Fogaras, Balázs Rácz
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
Our methods are presented in a general framework of Monte Carlo similarity search algorithms that precompute an index database of random fingerprints, and at query time, similarities are estimated from  ...  To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture.  ...  We say that a similarity search algorithm is scalable if the following properties hold: • Time: The index database is precomputed within the time of a sorting operation, up to a constant factor.  ... 
doi:10.1145/1060745.1060839 dblp:conf/www/FogarasR05 fatcat:4i2242pw2rd53lrsr4q7i3l5wm

ANTELOPE: A Semantic-Aware Data Cube Scheme for Cloud Data Center Networks

Yu Hua, Xue Liu, Hong Jiang
2014 IEEE transactions on computers  
The basic idea behind ANTELOPE is to leverage precomputation based data cube to support online cloud services.  ...  A fundamental problem is how to significantly improve the large-scale system's scalability to interconnect a large number of servers and meanwhile support various online services in cloud computing.  ...  Therefore, ANTELOPE can avoid or minimize the linear searches.  ... 
doi:10.1109/tc.2013.110 fatcat:b6j6hevcafevve3cinw4l4gkaa

Hike: A High Performance kNN Query Processing System for Multimedia Data

Hui Li, Ling Liu, Xiao Zhang, Shan Wang
2015 2015 IEEE Conference on Collaboration and Internet Computing (CIC)  
Our results show that DPR-Tree indexing coupled with precomputed distance based query processing make the Hike system can significantly reduce the overall cost of kNN search, and is much faster than the  ...  In this paper we present Hike, a high performance multimedia kNN query processing system, it integrate the proposed novel Distance-Precomputation based R-tree (DPR-Tree) index structure, coupled with the  ...  search become more scalable.  ... 
doi:10.1109/cic.2015.44 dblp:conf/coinco/LiLZW15 fatcat:xrm6rkmrj5gttbx5yc3nanpkpq

Multiway range trees: scalable IP lookup with fast updates

Priyank Warkhede, Subhash Suri, George Varghese
2004 Computer Networks  
Our scheme is based on a new data structure, a multiway range tree.  ...  In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table.  ...  The main drawback of existing lookup schemes is their lack of both scalability and fast update. Current IP lookup schemes come in two categories: those that use precomputation, and those that do not.  ... 
doi:10.1016/j.comnet.2003.09.004 fatcat:lpfb2jq36zeozbdffe5okuwimq

A scalable approach to the partition of QoS requirements in unicast and multicast

A. Orda, A. Sprintson
2005 IEEE/ACM Transactions on Networking  
In addition, recently proposed precomputation-based methods can be employed to facilitate scalability by significantly reducing the time needed for handling incoming requests.  ...  An important problem in this context is how to partition QoS requirements along a selected topology (path for unicast and tree for multicast).  ...  Accordingly, we employ the precomputation approach in order to improve the scalability of our solutions.  ... 
doi:10.1109/tnet.2005.857122 fatcat:uhxzyrngbbgyngiqfk6pzz7uje

Precomputed Search Trees: Planning for Interactive Goal-Driven Animation [article]

Manfred Lau, James J. Kuffner
2006 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA '04  
The key idea is to precompute search trees of motion clips that can be applied to arbitrary environments.  ...  Right: The first two levels of a small search tree example. Figure 4 : 4 Frequency plot of the precomputed search tree.  ...  Our approach is different in that we precompute a search tree of possible future actions.  ... 
doi:10.2312/sca/sca06/299-308 fatcat:76ibvql63fcwpfxizodaji2xgu

Scalable, flexible and generic instant overview search

Pavlos Fafalios, Ioannis Kitsos, Yannis Tzitzikas
2012 Proceedings of the 21st international conference companion on World Wide Web - WWW '12 Companion  
In this paper we present and demonstrate a family of instant search applications which apart from showing instantly only the top search results, they can show various other kinds of precomputed aggregated  ...  This paradigm is more helpful for the end user (in comparison to the classic search-as-you-type), since it can combine autocompletion, search-as-you-type, results clustering, faceted search, entity mining  ...  For the top suggestion, we access the corresponding random access file and retrieve its first page of results and its cluster label tree.  ... 
doi:10.1145/2187980.2188042 dblp:conf/www/FafaliosKT12 fatcat:75j6mfh4ljepbbbw46g276xnwi

An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations

S. Dechu, C. Shen, C. Chu
2005 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Our algorithm is scalable with problem size. We handle wire sizing with out any increase in runtime. 1 . 1 Fast-Route is much faster and scalable. We apply stochastic search on a small search space.  ...  Topology search based approaches try to reduce the runtime by limiting the search space to certain topologies. But these algorithms cannot handle wire sizing and are not scalable with problem size.  ... 
doi:10.1109/tcad.2005.844107 fatcat:kcp52r75wndapd733ajnhlwige

Dimensional testing for reverse k-nearest neighbor search

Guillaume Casanova, Elias Englmeier, Michael E. Houle, Peer Kröger, Michael Nett, Erich Schubert, Arthur Zimek
2017 Proceedings of the VLDB Endowment  
Our approach thus addresses many of the scalability issues surrounding the use of previous methods in data mining.  ...  Given a query object q, reverse k-nearest neighbor (RkNN) search aims to locate those objects of the database that have q among their k-nearest neighbors.  ...  can be performed during the same amount of time required for the precomputation of the RdNN-Tree.  ... 
doi:10.14778/3067421.3067426 fatcat:wx4dp2k2x5h7tnifkqichxdomy

A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree

Yeim-Kuan Chang, Yung-Chieh Lin
2009 2009 International Conference on Advanced Information Networking and Applications  
B-tree).  ...  For a routing table of n prefixes, MMSPT requires O(n) memory, and the time for search, insertion and deletion operations are O(log m n), O(mlog m n), and O(mlog m n), respectively (m is the order of the  ...  Scalability. Here the scalability means two things. One is the scalability to the number of routing entries in routing tables and the other is the scalability to the address length.  ... 
doi:10.1109/aina.2009.63 dblp:conf/aina/ChangL09 fatcat:zv5ey3jnczgrbihxub4icedexm

Parallelization of Phylogenetic Tree Inference Using Grid Technologies [chapter]

Yo Yamamoto, Hidemoto Nakada, Hidetoshi Shimodaira, Satoshi Matsuoka
2005 Lecture Notes in Computer Science  
The maximum likelihood method is considered as one of the most reliable methods for phylogenetic tree inference.  ...  However, as the number of species increases, the approach quickly loses its applicability due to explosive exponential number of trees that need to be considered.  ...  Here, for benchmarking purposes, we precompute the likelihood values of all the phylogenetic trees beforehand, and have the termination condition be such that the result falls within 1% of the precomputed  ... 
doi:10.1007/978-3-540-32251-1_10 fatcat:j7g5bcqwtbgxtbpom2sovxjhhu

Scalable high speed IP routing lookups

Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
1997 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '97  
Our paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths.  ...  We also introduce Mutating Binary Search and other optimizations that, for a typical IPv4 backbone router with over 33,000 entries, considerably reduce the average number of hashes to less than 2, of which  ...  First, precomputing optimal trees can increase the time to insert a new prefix. Second, the storage required to store an optimal binary tree for each prefix appears to be enormous.  ... 
doi:10.1145/263105.263136 dblp:conf/sigcomm/WaldvogelVTP97 fatcat:de7vvtxebvcbzhdgwowo7vwmri

Scalable high speed IP routing lookups

Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
1997 Computer communication review  
Our paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths.  ...  We also introduce Mutating Binary Search and other optimizations that, for a typical IPv4 backbone router with over 33,000 entries, considerably reduce the average number of hashes to less than 2, of which  ...  First, precomputing optimal trees can increase the time to insert a new prefix. Second, the storage required to store an optimal binary tree for each prefix appears to be enormous.  ... 
doi:10.1145/263109.263136 fatcat:k3l2g57ygnddbmzofv3a6fwlzm

QueryPIE: Backward Reasoning for OWL Horst over Very Large Knowledge Bases [chapter]

Jacopo Urbani, Frank van Harmelen, Stefan Schlobach, Henri Bal
2011 Lecture Notes in Computer Science  
Backward-chaining does not need such an expensive and change-sensitive precomputation, and is therefore suitable for more frequently changing knowledge bases, but has to perform more computation at query  ...  For a very small cost in both data space and upfront computation time (see table 5), we substantially reduce the search tree.  ...  -Encourage early failure of branches, allowing to prune the and-or tree, by using the precomputed branches.  ... 
doi:10.1007/978-3-642-25073-6_46 fatcat:o6zepb5y2rbznoo6rdtvy3mw7a
« Previous Showing results 1 — 15 out of 4,283 results