Sciweavers

1091 search results - page 56 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 8 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
ICANN
2007
Springer
13 years 11 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
13 years 5 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
CBMS
2007
IEEE
14 years 2 months ago
MS2DB: A Mass-Based Hashing Algorithm for the Identification of Disulfide Linkage Patterns in Protein Utilizing Mass Spectrometr
The tertiary structure and biological function of a protein can be better understood given knowledge of the number and location of its disulfide bonds. By utilizing mass spectrome...
Timothy Lee, Rahul Singh, Ten-Yang Yen, Bruce Mach...