Sciweavers

5350 search results - page 319 / 1070
» Space and time in eco-ontologies
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 8 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 6 months ago
Relay Assisted Cooperative OSTBC Communication with SNR Imbalance and Channel Estimation Errors
In this paper, a two-hop relay assisted cooperative Orthogonal Space-Time Block Codes (OSTBC) transmission scheme is considered for the downlink communication of a cellular system,...
Bo Niu, Mihaela C. Beluri, Zinan Lin, Prabhakar Ch...
IPM
2006
75views more  IPM 2006»
15 years 6 months ago
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
Berkant Barla Cambazoglu, Cevdet Aykanat
DSP
2007
15 years 6 months ago
Knowledge based adaptive processing for ground moving target indication
This paper presents a preliminary knowledge based approach to Space-Time Adaptive Processing (STAP) for ground moving target indication from an airborne platform. The KB-processor...
Raviraj Adve, Todd Hale, Michael C. Wicks
153
Voted
TCAD
2008
65views more  TCAD 2008»
15 years 6 months ago
Fashion: A Fast and Accurate Solution to Global Routing Problem
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...
Zhen Cao, Tong Jing, Jinjun Xiong, Yu Hu, Zhe Feng...