Sciweavers

70 search results - page 3 / 14
» An Exact Characterization of Greedy Structures
Sort
View
105
Voted
TKDE
2008
128views more  TKDE 2008»
14 years 9 months ago
A Virtual Ring Method for Building Small-World Structured P2P Overlays
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base es embedded in ID spaces with distance metric. Its basic ide...
Hai Zhuge, Xiaoping Sun
KDD
2008
ACM
202views Data Mining» more  KDD 2008»
15 years 9 months ago
Data and Structural k-Anonymity in Social Networks
The advent of social network sites in the last years seems to be a trend that will likely continue. What naive technology users may not realize is that the information they provide...
Alina Campan, Traian Marius Truta
84
Voted
TIT
2010
115views Education» more  TIT 2010»
14 years 4 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
IJFCS
2006
81views more  IJFCS 2006»
14 years 9 months ago
Combinatorial Properties of Sturmian Palindromes
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
Aldo de Luca, Alessandro De Luca
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
15 years 3 months ago
Scheduling under resource constraints using dis-equations
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
Hadda Cherroun, Alain Darte, Paul Feautrier