Sciweavers

356 search results - page 69 / 72
» Parallelizing time with polynomial circuits
Sort
View
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 7 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
CCGRID
2006
IEEE
13 years 11 months ago
A Feedback Mechanism for Network Scheduling in LambdaGrids
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. A LambdaGri...
Pallab Datta, Sushant Sharma, Wu-chun Feng
IPPS
2005
IEEE
14 years 1 months ago
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithm in WDM Networks with Sparse Wavelength Con
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile ag...
Vinh Trong Le, Xiaohong Jiang, Son-Hong Ngo, Susum...
CONCUR
2004
Springer
14 years 1 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
TPDS
2010
256views more  TPDS 2010»
13 years 6 months ago
Privacy-Conscious Location-Based Queries in Mobile Environments
— In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing...
Jianliang Xu, Xueyan Tang, Haibo Hu, Jing Du