Sciweavers

34 search results - page 2 / 7
» A Logarithmic Time Method for Two's Complementation
Sort
View
173
Voted
MMAS
2010
Springer
14 years 11 months ago
An Asymptotic Analysis of the Mean First Passage Time for Narrow Escape Problems: Part I: Two-Dimensional Domains
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
S. Pillay, Michael J. Ward, A. Peirce, Theodore Ko...
TC
2008
15 years 4 months ago
Power and Area-Efficient Unified Computation of Vector and Elementary Functions for Handheld 3D Graphics Systems
A unified computation method of vector and elementary functions is proposed for handheld 3D graphics systems. It unifies vector operations like vector multiply, multiply-and-add, d...
Byeong-Gyu Nam, Hyejung Kim, Hoi-Jun Yoo
140
Voted
FORMATS
2006
Springer
15 years 8 months ago
Undecidable Problems About Timed Automata
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
Olivier Finkel
FOCS
1989
IEEE
15 years 9 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
SPAA
1999
ACM
15 years 9 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...