Sciweavers

297 search results - page 41 / 60
» On the Fastest Vickrey Algorithm
Sort
View
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 10 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
ICCD
2002
IEEE
128views Hardware» more  ICCD 2002»
14 years 6 months ago
Subword Sorting with Versatile Permutation Instructions
Subword parallelism has succeeded in accelerating many multimedia applications. Subword permutation instructions have been proposed to efficiently rearrange subwords in or among r...
Zhijie Shi, Ruby B. Lee
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
14 years 4 months ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
GLOBECOM
2007
IEEE
14 years 4 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
ICTAI
2006
IEEE
14 years 3 months ago
Efficient Search Using Bitboard Models
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
Pablo San Segundo, Ramón Galán, Fern...