Sciweavers

2600 search results - page 27 / 520
» Clustering with or without the Approximation
Sort
View
SIAMCO
2010
124views more  SIAMCO 2010»
13 years 2 months ago
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidan...
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 9 months ago
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
Loreto Bravo, Wenfei Fan, Floris Geerts, Shuai Ma
WWW
2005
ACM
14 years 8 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
ICB
2007
Springer
148views Biometrics» more  ICB 2007»
14 years 1 months ago
Walker Recognition Without Gait Cycle Estimation
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
Daoliang Tan, Shiqi Yu, Kaiqi Huang, Tieniu Tan
CARDIS
2000
Springer
124views Hardware» more  CARDIS 2000»
14 years 1 days ago
Elliptic Curve Cryptography on Smart Cards without Coprocessors
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
Adam D. Woodbury, Daniel V. Bailey, Christof Paar