Sciweavers

2631 search results - page 524 / 527
» A Practical Method for the Sparse Resultant
Sort
View
INFORMS
2010
138views more  INFORMS 2010»
13 years 6 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
JCS
2010
135views more  JCS 2010»
13 years 6 months ago
New filtering approaches for phishing email
Phishing emails usually contain a message from a credible looking source requesting a user to click a link to a website where she/he is asked to enter a password or other confide...
André Bergholz, Jan De Beer, Sebastian Glah...
PR
2010
126views more  PR 2010»
13 years 6 months ago
Discriminability and reliability indexes: Two new measures to enhance multi-image face recognition
In order to handle complex face image variations in face recognition, multi-image face recognition has been proposed, instead of using a single still-imagebased approach. In many ...
Weiwen Zou, Pong C. Yuen
PVLDB
2010
82views more  PVLDB 2010»
13 years 6 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg