Sciweavers

2168 search results - page 207 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
MCS
2010
Springer
15 years 3 months ago
Goal-oriented a posteriori error estimates for transport problems
Some aspects of goal-oriented a posteriori error estimation are addressed in the context of steady convection-diffusion equations. The difference between the exact and approxima...
Dmitri Kuzmin, Sergey Korotov
DATAMINE
2006
176views more  DATAMINE 2006»
15 years 4 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
141
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
157
Voted
IACR
2011
173views more  IACR 2011»
14 years 4 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
NIPS
2007
15 years 6 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola