Sciweavers

4850 search results - page 202 / 970
» Approximate Data Structures with Applications
Sort
View
SADM
2008
178views more  SADM 2008»
15 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
INFOCOM
2012
IEEE
13 years 9 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 6 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
QRE
2010
129views more  QRE 2010»
15 years 5 months ago
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
Rajesh Ganesan, Poornima Balakrishna, Lance Sherry
DATE
2005
IEEE
167views Hardware» more  DATE 2005»
16 years 5 days ago
A New Task Model for Streaming Applications and Its Schedulability Analysis
In this paper we introduce a new task model that is specifically targeted towards representing stream processing applications. Examples of such applications are those involved in...
Samarjit Chakraborty, Lothar Thiele