Sciweavers

86 search results - page 12 / 18
» Distance between two k-sets and Path-Systems Extendibility
Sort
View
MM
2003
ACM
113views Multimedia» more  MM 2003»
15 years 2 months ago
R-Histogram: quantitative representation of spatial relations for similarity-based image retrieval
Representation of relative spatial relations between objects is required in many multimedia database applications. Quantitative representation of spatial relations taking into acc...
Yuhang Wang, Fillia Makedon
VTC
2006
IEEE
158views Communications» more  VTC 2006»
15 years 3 months ago
An Adaptive-Scaling Algorithm for OFDM PAR Reduction Using Active Constellation Extension
Abstract— The Active Constellation Extension (ACE) technique is a lossless (in terms of throughput) Peak-to-Average Power Ratio (PAR) reduction technique that adaptively extends ...
Luqing Wang, Chintha Tellambura
EPIA
2009
Springer
15 years 4 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
15 years 1 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
SIGMETRICS
2006
ACM
15 years 3 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph