Sciweavers

963 search results - page 180 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
DPD
2010
153views more  DPD 2010»
13 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
AAAI
2008
13 years 9 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
TWC
2008
125views more  TWC 2008»
13 years 7 months ago
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
Abstract--In this paper, we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the ...
Ahmed S. Ibrahim, Ahmed K. Sadek, Weifeng Su, K. J...
CODES
2005
IEEE
14 years 1 months ago
Shift buffering technique for automatic code synthesis from synchronous dataflow graphs
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
Hyunok Oh, Nikil D. Dutt, Soonhoi Ha