Sciweavers

2634 search results - page 10 / 527
» Faster Than Uppaal
Sort
View
ADC
2008
Springer
135views Database» more  ADC 2008»
14 years 1 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo
FSR
2007
Springer
122views Robotics» more  FSR 2007»
14 years 1 months ago
Roving Faster Farther Cheaper
Current Mars rovers travel a few kilometers per year. Future rovers will need to travel a couple orders of magnitude faster than that in order to move from safe landing zones to a...
Matt Roman, David P. Miller, Zac White
APN
2008
Springer
13 years 9 months ago
Faster Unfolding of General Petri Nets Based on Token Flows
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
Robin Bergenthum, Robert Lorenz, Sebastian Mauser
IJCGA
2008
132views more  IJCGA 2008»
13 years 7 months ago
Constructing the City Voronoi Diagram Faster
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
Robert Görke, Chan-Su Shin, Alexander Wolff
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
14 years 7 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer