Sciweavers

3206 search results - page 257 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
104
Voted
FOCS
2008
IEEE
15 years 10 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
Michael Ben-Or, Avinatan Hassidim
146
Voted
JPDC
2008
110views more  JPDC 2008»
15 years 3 months ago
Parallel multilevel algorithms for hypergraph partitioning
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
Aleksandar Trifunovic, William J. Knottenbelt
133
Voted
CGO
2006
IEEE
15 years 9 months ago
Selecting Software Phase Markers with Code Structure Analysis
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Jeremy Lau, Erez Perelman, Brad Calder
150
Voted
CIKM
2010
Springer
14 years 10 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
167
Voted
ICIP
2001
IEEE
16 years 5 months ago
Image retrieval with relevance feedback: from heuristic weight adjustment to optimal learning methods
Various relevance feedback algorithms have been proposed in recent years in the area of content-based image retrieval. This paper gives a brief review and analysis on existing tec...
Xiang Sean Zhou, Thomas S. Huang