Sciweavers

903 search results - page 102 / 181
» Non-well-founded trees in categories
Sort
View
SPAA
2004
ACM
15 years 11 months ago
A scalable lock-free stack algorithm
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
Danny Hendler, Nir Shavit, Lena Yerushalmi
SLIP
2003
ACM
15 years 11 months ago
A hierarchical three-way interconnect architecture for hexagonal processors
The problem of interconnect architecture arises when an array of processors needs to be integrated on one chip. With the deep sub-micron technology, devices become cheap while wir...
Feng Zhou, Esther Y. Cheng, Bo Yao, Chung-Kuan Che...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
MOBIHOC
2009
ACM
15 years 11 months ago
Exploring 700mhz WiFi-based wireless mesh networking
This paper describes the deployment and evaluation of a 700MHz WiFi-based Wireless Mesh Network (WMN) testbed. To our knowledge, this is the world’s first WiFi-based testbed us...
Yan He, Van Nguyen, Dmitri Perkins, Nian-Feng Tzen...
ISEC
2001
Springer
180views ECommerce» more  ISEC 2001»
15 years 10 months ago
i-Cube: A Tool-Set for the Dynamic Extraction and Integration of Web Data Content
Over the past decade the Internet has evolved into the largest public community in the world. It provides a wealth of data content and services in almost every field of science, t...
Frankie Poon, Kostas Kontogiannis