Sciweavers

240 search results - page 45 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View

Publication
232views
13 years 6 months ago
Measurement in 802.11 Wireless Networks and its Applications
Ease of deployment, wireless connectivity and ubiquitous mobile on-the-go computing has made the IEEE 802.11 the most widely deployed Wireless Local Area Network (WLAN) sta...
Malik Ahmad Yar Khan
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 8 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
CLADE
2004
IEEE
14 years 10 days ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
BMCBI
2006
116views more  BMCBI 2006»
13 years 8 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
CIKM
2008
Springer
13 years 10 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han