Sciweavers

1170 search results - page 76 / 234
» How Fast Is Too Fast
Sort
View
CICLING
2010
Springer
15 years 7 months ago
Word Length n-Grams for Text Re-use Detection
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
Alberto Barrón-Cedeño, Chiara Basile...
HYBRID
2004
Springer
15 years 8 months ago
Almost ASAP Semantics: From Timed Models to Timed Implementations
In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP semantics. This semantics is a relaxation of the usual ASAP3 semantics (also called ...
Martin De Wulf, Laurent Doyen, Jean-Françoi...
ENTCS
2006
118views more  ENTCS 2006»
15 years 3 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
ICML
2006
IEEE
16 years 3 months ago
Robust Euclidean embedding
We derive a robust Euclidean embedding procedure based on semidefinite programming that may be used in place of the popular classical multidimensional scaling (cMDS) algorithm. We...
Lawrence Cayton, Sanjoy Dasgupta
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 9 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner