Sciweavers

1626 search results - page 261 / 326
» Hybrid computing algorithm in representing solid model
Sort
View
INFOCOM
2012
IEEE
13 years 5 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
PKDD
2005
Springer
164views Data Mining» more  PKDD 2005»
15 years 8 months ago
Clustering and Prediction of Mobile User Routes from Cellular Data
Location-awareness and prediction of future locations is an important problem in pervasive and mobile computing. In cellular systems (e.g., GSM) the serving cell is easily availabl...
Kari Laasonen
CP
1997
Springer
15 years 7 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
TSE
2010
151views more  TSE 2010»
15 years 1 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
PG
2007
IEEE
15 years 9 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain