Sciweavers

1439 search results - page 67 / 288
» Fast approximation of centrality
Sort
View
123
Voted
NIPS
2008
15 years 4 months ago
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
Liang Zhang, Deepak Agarwal
131
Voted
EOR
2008
107views more  EOR 2008»
15 years 3 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
123
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
119
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
Dynamic Load Balancing Through Coordinated Scheduling in Packet Data Systems
— Third generation code-division multiple access (CDMA) systems propose to provide packet data service through a high speed shared channel with intelligent and fast scheduling at...
Suman Das, Harish Viswanathan, Gee Rittenhouse
142
Voted
VLSM
2005
Springer
15 years 9 months ago
Fast Marching Method for Generic Shape from Shading
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
Emmanuel Prados, Stefano Soatto