Sciweavers

6251 search results - page 1040 / 1251
» Randomness, Computability, and Density
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 4 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
VLSID
2008
IEEE
117views VLSI» more  VLSID 2008»
16 years 4 months ago
Single Event Upset: An Embedded Tutorial
Abstract-- With the continuous downscaling of CMOS technologies, the reliability has become a major bottleneck in the evolution of the next generation systems. Technology trends su...
Fan Wang, Vishwani D. Agrawal
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
16 years 4 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
16 years 4 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 4 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
« Prev « First page 1040 / 1251 Last » Next »