Sciweavers

2250 search results - page 378 / 450
» Authorizing applications in singularity
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 4 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
ICALP
2009
Springer
16 years 4 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
VLDB
2002
ACM
120views Database» more  VLDB 2002»
16 years 4 months ago
Efficient schemes for managing multiversionXML documents
Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and "...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 4 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 4 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu