Sciweavers

4761 search results - page 925 / 953
» Generalizing Boundary Points
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 9 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 9 months ago
Ambient Multimodality: an Asset for Developing Universal Access to the Information Society
Our aim is to point out the benefits that can be derived from research advances in the implementation of concepts such as ambient intelligence and ubiquitous/pervasive computing f...
Noelle Carbonell
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
An annotation based approach to support design communication
The aim of this paper is to propose an approach based on the concept of annotation for supporting design communication. In this paper, we describe a co-operative design case study...
Onur Hisarciklilar, Jean-François Boujut
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 9 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
ISI
2006
Springer
13 years 9 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...