Sciweavers

4761 search results - page 823 / 953
» Generalizing Boundary Points
Sort
View
85
Voted
INFORMS
2010
138views more  INFORMS 2010»
14 years 11 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
113
Voted
PRL
2010
188views more  PRL 2010»
14 years 11 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
106
Voted
RFIDSEC
2010
14 years 11 months ago
Optimal Security Limits of RFID Distance Bounding Protocols
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
Orhun Kara, Süleyman Kardas, Muhammed Ali Bin...
CN
2010
91views more  CN 2010»
14 years 11 months ago
ILP formulations for non-simple p-cycle and p-trail design in WDM mesh networks
Conventional simple p-cycle (Preconfigured Protection Cycle) concept allows fast and capacity-efficient span protection in WDM mesh networks. Unlike simple p-cycle, non-simple p-cy...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
178
Voted
IWPEC
2010
Springer
14 years 10 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...