Sciweavers

2883 search results - page 162 / 577
» Algorithms for merged indexes
Sort
View
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
16 years 6 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
APDC
1997
15 years 7 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
SIGIR
2008
ACM
15 years 5 months ago
Algorithmic mediation for collaborative exploratory search
We describe a new approach to information retrieval: algorithmic mediation for intentional, synchronous collaborative exploratory search. Using our system, two or more users with ...
Jeremy Pickens, Gene Golovchinsky, Chirag Shah, Pe...
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
16 years 1 days ago
An efficient static algorithm for computing the soft error rates of combinational circuits
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...
Rajeev R. Rao, Kaviraj Chopra, David Blaauw, Denni...
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
15 years 5 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham