Sciweavers

13987 search results - page 586 / 2798
» The Two Guards Problem
Sort
View
INFOCOM
2005
IEEE
16 years 25 days ago
Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
Arindam Kumar Das, Robert J. Marks II, Payman Arab...
LICS
2005
IEEE
16 years 25 days ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
IQIS
2005
ACM
16 years 24 days ago
Blocking-aware private record linkage
In this paper, the problem of quickly matching records (i.e., record linkage problem) from two autonomous sources without revealing privacy to the other parties is considered. In ...
Ali Al-Lawati, Dongwon Lee, Patrick McDaniel
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
16 years 24 days ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
CPM
2005
Springer
106views Combinatorics» more  CPM 2005»
16 years 23 days ago
An Optimal Algorithm for Online Square Detection
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...
Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu