Sciweavers

1477 search results - page 279 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
APSEC
2003
IEEE
15 years 3 months ago
Understanding How the Requirements Are Implemented in Source Code
For software maintenance and evolution, a common problem is to understand how each requirement is implemented in the source code. The basic solution of this problem is to find the...
Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun
IPPS
1999
IEEE
15 years 2 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
SIGGRAPH
1997
ACM
15 years 1 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing