Sciweavers

119 search results - page 22 / 24
» Can We Ever Escape from Data Overload
Sort
View
TWC
2008
116views more  TWC 2008»
13 years 7 months ago
The performance of multi-user cooperative diversity in an asynchronous CDMA uplink
Abstract--This paper investigates the impact of interuser non-orthogonality and asynchronous communication on the information-outage probability performance of multi-user decode-an...
Kanchan G. Vardhe, Daryl Reynolds, Matthew C. Vale...
BMCBI
2007
124views more  BMCBI 2007»
13 years 7 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Answering conceptual queries with Ferret
Programmers seek to answer questions as they investigate the functioning of a software system, such as "which execution path is being taken in this case?" Programmers at...
Brian de Alwis, Gail C. Murphy
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 1 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
ASPLOS
2008
ACM
13 years 9 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...