Sciweavers

1376 search results - page 255 / 276
» A Computational Framework for Handling Motion
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 10 days ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
WWW
2010
ACM
13 years 8 months ago
Mining advertiser-specific user behavior using adfactors
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishna...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 10 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
ISSTA
2012
ACM
11 years 10 months ago
Finding errors in multithreaded GUI applications
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
Sai Zhang, Hao Lü, Michael D. Ernst
TKDE
2012
192views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Discriminative Feature Selection by Nonparametric Bayes Error Minimization
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
Shuang-Hong Yang, Bao-Gang Hu