Sciweavers

2485 search results - page 151 / 497
» Time Bounded Frequency Computations
Sort
View
254
Voted
APDC
1997
15 years 6 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
BROADNETS
2004
IEEE
15 years 8 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
DAC
2008
ACM
16 years 6 months ago
Parallel programming: can we PLEASE get it right this time?
The computer industry has a problem. As Moore's law marches on, we will be exploiting it to double cores, not frequencies. But all those cores ... 2 to 4 today growing to 8, ...
Tim Mattson, Michael Wrinn
DC
2008
15 years 5 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
DEXA
1998
Springer
124views Database» more  DEXA 1998»
15 years 9 months ago
Indexing Time-Series Databases for Inverse Queries
Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence co...
Alexandros Nanopoulos, Yannis Manolopoulos