Sciweavers

6590 search results - page 922 / 1318
» Evaluating the performance engineering process
Sort
View
JSAC
2008
136views more  JSAC 2008»
15 years 6 months ago
Fixed point opportunistic routing in delay tolerant networks
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...
Vania Conan, Jeremie Leguay, Timur Friedman
ECRA
2007
69views more  ECRA 2007»
15 years 6 months ago
NetPay: An off-line, decentralized micro-payment system for thin-client applications
Micro-payment systems have become popular in recent times as the desire to support low-value, high-volume transactions of text, music, clip-art, video and other media has increase...
Xiaoling Dai, John C. Grundy
AIR
2005
119views more  AIR 2005»
15 years 6 months ago
An Assessment of Case-Based Reasoning for Spam Filtering
Because of the changing nature of spam, a spam filtering system that uses machine learning will need to be dynamic. This suggests that a case-based (memory-based) approach may work...
Sarah Jane Delany, Padraig Cunningham, Lorcan Coyl...
IJRR
2007
80views more  IJRR 2007»
15 years 6 months ago
Fast Laser Scan Matching using Polar Coordinates
In this paper a novel Polar Scan Matching (PSM) approach is described that works in the laser scanner’s polar coordinate system, therefore taking advantage of the structure of t...
Albert Diosi, Lindsay Kleeman
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa