Sciweavers

7006 search results - page 948 / 1402
» Approximation Algorithms
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 4 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
GIS
2006
ACM
16 years 8 months ago
Filtering with raster signatures
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...
183
Voted
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
199
Voted
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
16 years 1 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...
215
Voted
WCNC
2008
IEEE
16 years 1 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung