Sciweavers

51 search results - page 10 / 11
» Approximating (r, p)-Centroid on a Path
Sort
View
SMA
2010
ACM
181views Solid Modeling» more  SMA 2010»
13 years 6 months ago
Merging and smoothing machining boundaries on cutter location surfaces
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
Weishi Li, Ralph R. Martin, Frank C. Langbein
JEA
2006
83views more  JEA 2006»
13 years 5 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
EAAI
2007
103views more  EAAI 2007»
13 years 5 months ago
Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
Ganesh K. Venayagamoorthy, Scott C. Smith, Gaurav ...
TWC
2008
146views more  TWC 2008»
13 years 5 months ago
Synchronization, Channel Estimation, and Equalization in MB-OFDM Systems
Abstract-- This paper addresses preamble-based low complexity synchronization, channel estimation and equalization for Zero-padded (ZP) MB-OFDM based UWB systems. The proposed sync...
Yinghui Li, Hlaing Minn, R. M. A. Rajatheva
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 7 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...