376 search results - page 36 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
FPGA
1999
ACM
14 years 6 hour ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
JAIR
2007
13 years 7 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
PAMI
2002
13 years 7 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...