Sciweavers

3146 search results - page 391 / 630
» Efficient Consequence Finding
Sort
View
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
15 years 7 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
SOFSEM
2000
Springer
15 years 7 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
TPDS
2008
188views more  TPDS 2008»
15 years 3 months ago
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
TWC
2008
120views more  TWC 2008»
15 years 3 months ago
Cooperation Enforcement and Learning for Optimizing Packet Forwarding in Autonomous Wireless Networks
In wireless ad hoc networks, autonomous nodes are reluctant to forward others' packets because of the nodes' limited energy. However, such selfishness and noncooperation ...
Charles Pandana, Zhu Han, K. J. Ray Liu
WWW
2007
ACM
16 years 4 months ago
Crawling multiple UDDI business registries
As Web services proliferate, size and magnitude of UDDI Business Registries (UBRs) are likely to increase. The ability to discover Web services of interest then across multiple UB...
Eyhab Al-Masri, Qusay H. Mahmoud