Sciweavers

485 search results - page 37 / 97
» Iterative Bounding LAO
Sort
View
CORR
2012
Springer
286views Education» more  CORR 2012»
14 years 2 days ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
SMI
2005
IEEE
109views Image Analysis» more  SMI 2005»
15 years 10 months ago
Practical Spherical Embedding of Manifold Triangle Meshes
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
Shadi Saba, Irad Yavneh, Craig Gotsman, Alla Sheff...
WOWMOM
2005
ACM
115views Multimedia» more  WOWMOM 2005»
15 years 10 months ago
Precise Distributed Localization Algorithms for Wireless Networks
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
Saad Biaz, Yiming Ji
DATE
2002
IEEE
69views Hardware» more  DATE 2002»
15 years 9 months ago
Verifying Clock Schedules in the Presence of Cross Talk
This paper addresses verifying the timing of circuits containing level-sensitive latches in the presence of cross talk. We show that three consecutive periodic occurrences of the ...
Soha Hassoun, Eduardo Calvillo-Gámez, Chris...
130
Voted
ASIACRYPT
2001
Springer
15 years 8 months ago
Practical Construction and Analysis of Pseudo-Randomness Primitives
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
Johan Håstad, Mats Näslund