Sciweavers

2497 search results - page 402 / 500
» Requirements for models of achievable routing
Sort
View
86
Voted
CHI
2009
ACM
16 years 2 months ago
DynaSpot: speed-dependent area cursor
We present DynaSpot, a new technique for acquiring targets based on the area cursor. DynaSpot couples the cursor's activation area with its speed, behaving like a point curso...
Olivier Chapuis, Jean-Baptiste Labrune, Emmanuel P...
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 2 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
CHI
2006
ACM
16 years 2 months ago
Reality testing: HCI challenges in non-traditional environments
Non-traditional environments often change rapidly without forewarning, are difficult or impossible to control, and have other environmental and operational constraints that cannot...
Gisele Bennett, Gitte Lindgaard, Bruce Tsuji, Kay ...
IEEEARES
2010
IEEE
15 years 8 months ago
Solving the Transitive Access Problem for the Services Oriented Architecture
: © Solving the Transitive Access Problem for the Services Oriented Architecture Alan H. Karp, Jun Li HP Laboratories HPL-2008-204R1 SOA, web services, access control, RBAC, PBAC,...
Alan H. Karp, Jun Li
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
15 years 8 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...