Sciweavers

378 search results - page 56 / 76
» How Many Ways Can One Draw a Graph
Sort
View
162
Voted
SIGGRAPH
1997
ACM
15 years 7 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
104
Voted
CHI
2010
ACM
15 years 10 months ago
Gazemarks: gaze-based visual placeholders to ease attention switching
Many tasks require attention switching. For example, searching for information on one sheet of paper and then entering this information onto another one. With paper we see that pe...
Dagmar Kern, Paul Marshall, Albrecht Schmidt
136
Voted
DASFAA
2009
IEEE
252views Database» more  DASFAA 2009»
15 years 10 months ago
Optimal Privacy-Aware Path in Hippocratic Databases
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...
Min Li, Xiaoxun Sun, Hua Wang, Yanchun Zhang
ESEM
2007
ACM
15 years 7 months ago
A Critical Analysis of Empirical Research in Software Testing
In the foreseeable future, software testing will remain one of the best tools we have at our disposal to ensure software dependability. Empirical studies are crucial to software t...
Lionel C. Briand
146
Voted
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 9 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...