3008 search results - page 478 / 602 » Independence in connected graphs |
198
Voted
IDEAS
2000
IEEE
15 years 11 months ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
164
Voted
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
A built-in self-test (BIST) methodology to test system backplanes by using BIST functionality in each of its constituent boards is presented. Since the configurations of systems ...
200
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
178
Voted
HT
1997
ACM
15 years 11 months ago
1997
ACM
This paper discusses how to augment the WWW with a Dexter-based hypermedia service that provides anchors, links and composites as objects stored external to the Web pages. The hyp...
193
click to vote
SIGCOMM
1994
ACM
15 years 11 months ago
1994
ACM
Applications communicating over connectionless networks, such as IP, cannot obtain per-connection Quality of Service (QoS) guarantees. In contrast, the connection-oriented nature ...