Sciweavers

1451 search results - page 242 / 291
» Finding People by Sampling
Sort
View
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 3 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ALT
1997
Springer
14 years 1 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
CIKM
2006
Springer
13 years 12 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
HVEI
2010
13 years 11 months ago
Gloss discrimination and eye movements
Human observers are able to make fine discriminations of surface gloss. What cues are they using to perform this task? In previous studies, we identified two reflection-related cu...
Jonathan B. Phillips, James A. Ferwerda, Ann Nunzi...
ICIS
2003
13 years 11 months ago
The Impact of Information Technology Spending on Future Performance
In this study, we investigate the association between information technology (IT) spending and future firm performance. Critics contend that greater expenditures on IT rarely lead...
Mark C. Anderson, Rajiv D. Banker, Nan Hu