Sciweavers

APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 5 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
APN
2005
Springer
14 years 5 months ago
Determinate STG Decomposition of Marked Graphs
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
Mark Schäfer, Walter Vogler, Petr Jancar
AINTEC
2005
Springer
14 years 5 months ago
On the Stability of Server Selection Algorithms Against Network Fluctuations
Abstract. When a set of servers are available for a certain client-server style service, a client selects one of the servers using some server selection algorithm. The best-server ...
Toshiyuki Miyachi, Kenjiro Cho, Yoichi Shinoda
AIIA
2005
Springer
14 years 5 months ago
Experimental Evaluation of Hierarchical Hidden Markov Models
Building profiles for processes and for interactive users is a important task in intrusion detection. This paper presents the results obtained with a Hierarchical Hidden Markov Mo...
Attilio Giordana, Ugo Galassi, Lorenza Saitta
ACIVS
2005
Springer
14 years 5 months ago
Cleaning and Enhancing Historical Document Images
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
Ergina Kavallieratou, Hera Antonopoulou
WOSP
2005
ACM
14 years 5 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
SPAA
2005
ACM
14 years 5 months ago
Decentralized algorithms using both local and random probes for P2P load balancing
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
Krishnaram Kenthapadi, Gurmeet Singh Manku
GRAPHITE
2005
ACM
14 years 5 months ago
A loose and sketchy approach in a mediated reality environment
In this paper, we present sketchy-ar-us, a modified, real-time version of the Loose and Sketchy algorithm used to render graphics in an AR environment. The primary challenge was ...
Michael Haller, Florian Landerl, Mark Billinghurst
WONS
2005
IEEE
14 years 5 months ago
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
WIOPT
2005
IEEE
14 years 5 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran