Sciweavers

2020 search results - page 286 / 404
» Speeding up Slicing
Sort
View
DAGSTUHL
2007
13 years 10 months ago
An analytic solution to the alibi query in the bead model for moving object data
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
Bart Kuijpers, Walied Othman
LREC
2010
142views Education» more  LREC 2010»
13 years 10 months ago
Partial Parsing as a Method to Expedite Dependency Annotation of a Hindi Treebank
The paper describes an approach to expedite the process of manual annotation of a Hindi dependency treebank which is currently under development. We propose a way by which consist...
Mridul Gupta, Vineet Yadav, Samar Husain, Dipti Mi...
DLT
2008
13 years 10 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
NSDI
2010
13 years 10 months ago
Cheap and Large CAMs for High Performance Data-Intensive Networked Systems
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
Ashok Anand, Chitra Muthukrishnan, Steven Kappes, ...
SIROCCO
2010
13 years 10 months ago
Asynchronous Deterministic Rendezvous in Bounded Terrains
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...