Sciweavers

6110 search results - page 1140 / 1222
» Approximate Computing
Sort
View
CSB
2003
IEEE
124views Bioinformatics» more  CSB 2003»
15 years 11 months ago
SMASHing regulatory sites in DNA by human
Regulatory sequence elements provide important clues to understanding and predicting gene expression. Although the binding sites for hundreds of transcription factors are known, t...
Mihaela Zavolan, Nicholas D. Socci, Nikolaus Rajew...
FOCS
2003
IEEE
15 years 11 months ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 11 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
GRAPHITE
2003
ACM
15 years 11 months ago
Smooth surface reconstruction from noisy range data
This paper shows that scattered range data can be smoothed at low cost by fitting a Radial Basis Function (RBF) to the data and convolving with a smoothing kernel (low pass filt...
Jonathan C. Carr, Richard K. Beatson, Bruce C. McC...
SAC
2003
ACM
15 years 11 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
« Prev « First page 1140 / 1222 Last » Next »