Sciweavers

3268 search results - page 564 / 654
» The hub number of a graph
Sort
View
PEWASUN
2004
ACM
15 years 5 months ago
A performance evaluation framework for IEEE 802.11 ad-hoc networks
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
Ping Chung Ng, Soung Chang Liew, Li Bin Jiang
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 5 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
CC
2004
Springer
15 years 5 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
91
Voted
DEXA
2004
Springer
136views Database» more  DEXA 2004»
15 years 5 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
ECAI
2004
Springer
15 years 5 months ago
Tractability Results for Automatic Contracting
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
Paul E. Dunne, Michael Laurence, Michael Wooldridg...