Sciweavers

1461 search results - page 53 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
VTC
2007
IEEE
15 years 6 months ago
Fast and Area-Efficient Sphere Decoding Using Look-Ahead Search
— Sphere decoding enables maximum likelihood (ML) detection with fairly low complexity in the MIMO wireless systems, but it takes hundreds cycles at low SNR environment. This pap...
Se-Hyeon Kang, In-Cheol Park
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
15 years 5 months ago
Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
Tiancheng Li, Ninghui Li
ICPADS
2005
IEEE
15 years 5 months ago
Exploiting Multi-level Parallelism for Homology Search using General Purpose Processors
New biological experimental techniques are continuing to generate large amounts of data using DNA, RNA, human genome and protein sequences. The quantity and quality of data from t...
Xiandong Meng, Vipin Chaudhary
86
Voted
IBERAMIA
2004
Springer
15 years 5 months ago
A Multi-robot Strategy for Rapidly Searching a Polygonal Environment
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
IPPS
2003
IEEE
15 years 5 months ago
Using Hybrid Alignment for Iterative Sequence Database Searches
Progressive sequence model refinement by means of iterative searches is an effective technique for high sensitivity database searches and is currently employed in popular tools s...
Yuheng Li, Mario Lauria, Ralf Bundschuh