Sciweavers

1008 search results - page 183 / 202
» Canonicity!
Sort
View
LICS
2007
IEEE
15 years 4 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 4 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
CIE
2007
Springer
15 years 4 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
ICB
2007
Springer
208views Biometrics» more  ICB 2007»
15 years 4 months ago
Face Matching Between Near Infrared and Visible Light Images
Abstract. In many applications, such as E-Passport and driver’s license, the enrollment of face templates is done using visible light (VIS) face images. Such images are normally ...
Dong Yi, Rong Liu, Rufeng Chu, Zhen Lei, Stan Z. L...