Sciweavers

65 search results - page 6 / 13
» Reducing Computational Costs in the Basic Perturbation Lemma
Sort
View
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 3 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
TOG
2002
165views more  TOG 2002»
13 years 8 months ago
CHARMS: a simple framework for adaptive simulation
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
Eitan Grinspun, Petr Krysl, Peter Schröder
DCOSS
2010
Springer
14 years 1 months ago
Stateful Mobile Modules for Sensor Networks
Most sensor network applications are dominated by the acquisition of sensor values. Due to energy limitations and high energy costs of communication, in-network processing has been...
Moritz Strübe, Rüdiger Kapitza, Klaus St...
JMLR
2006
96views more  JMLR 2006»
13 years 9 months ago
A Hierarchy of Support Vector Machines for Pattern Detection
We introduce a computational design for pattern detection based on a tree-structured network of support vector machines (SVMs). An SVM is associated with each cell in a recursive ...
Hichem Sahbi, Donald Geman
CLUSTER
2002
IEEE
13 years 8 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut