Sciweavers

1539 search results - page 101 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
102
Voted
SOUPS
2009
ACM
15 years 9 months ago
Look into my eyes!: can you guess my password?
Authentication systems for public terminals – and thus public spaces – have to be fast, easy and secure. Security is of utmost importance since the public setting allows manif...
Alexander De Luca, Martin Denzel, Heinrich Hussman...
137
Voted
CTRSA
2005
Springer
78views Cryptology» more  CTRSA 2005»
15 years 8 months ago
New Minimal Weight Representations for Left-to-Right Window Methods
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...
James A. Muir, Douglas R. Stinson
LISA
1994
15 years 3 months ago
The Group Administration Shell and the GASH Network Computing Environment
Managing large scale UNIX networks so that users can use resources on multiple systems is traditionally performed using NIS, NFS, and DNS. Proper use of these tools requires exact...
Jonathan Abbey
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 7 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
131
Voted
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 9 months ago
A distributed Newton method for Network Utility Maximization
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
Ermin Wei, Asuman E. Ozdaglar, Ali Jadbabaie