Sciweavers

2485 search results - page 260 / 497
» Time Bounded Frequency Computations
Sort
View
SPAA
1995
ACM
13 years 12 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
DASFAA
2008
IEEE
116views Database» more  DASFAA 2008»
13 years 10 months ago
MBR Models for Uncertainty Regions of Moving Objects
The increase in the advanced location based services such as traffic coordination and management necessitates the need for advanced models tracking the positions of Moving Objects ...
Shayma Alkobaisi, Wan D. Bae, Seon Ho Kim, Byunggu...
ATAL
2010
Springer
13 years 9 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
DAC
2006
ACM
14 years 9 months ago
A thermally-aware performance analysis of vertically integrated (3-D) processor-memory hierarchy
Three-dimensional (3-D) integrated circuits have emerged as promising candidates to overcome the interconnect bottlenecks of nanometer scale designs. While they offer several othe...
Gian Luca Loi, Banit Agrawal, Navin Srivastava, Sh...
EMNLP
2008
13 years 9 months ago
Relative Rank Statistics for Dialog Analysis
We introduce the relative rank differential statistic which is a non-parametric approach to document and dialog analysis based on word frequency rank-statistics. We also present a...
Juan Huerta