Sciweavers

3206 search results - page 227 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
160
Voted
RECOMB
2004
Springer
16 years 4 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
123
Voted
SIGIR
2008
ACM
15 years 3 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
133
Voted
GECCO
2007
Springer
194views Optimization» more  GECCO 2007»
15 years 10 months ago
Hybrid coevolutionary algorithms vs. SVM algorithms
As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
Rui Li, Bir Bhanu, Krzysztof Krawiec
121
Voted
ICDAR
2009
IEEE
15 years 10 months ago
How to Improve a Handwriting Recognition System
The recognition of handwritten characters, words, and text arouses great interest today. To develop the best working system is subject of many papers published. With this paper, m...
Haikal El Abed, Volker Märgner
102
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant