Sciweavers

3088 search results - page 315 / 618
» Online Passive-Aggressive Algorithms
Sort
View
IPSN
2004
Springer
16 years 22 hour ago
Distributed particle filters for sensor networks
Abstract. This paper describes two methodologies for performing distributed particle filtering in a sensor network. It considers the scenario in which a set of sensor nodes make m...
Mark Coates
140
Voted
IWCIA
2009
Springer
15 years 11 months ago
What Does Digital Straightness Tell about Digital Convexity?
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
Tristan Roussillon, Laure Tougne, Isabelle Sivigno...
IPPS
1998
IEEE
15 years 11 months ago
Deterministic Routing of h-relations on the Multibutterfly
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
Andrea Pietracaprina
160
Voted
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 10 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
AAAI
2007
15 years 9 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...