Sciweavers

1302 search results - page 93 / 261
» On the Strong Chromatic Number
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 10 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
EMO
2006
Springer
122views Optimization» more  EMO 2006»
15 years 10 months ago
Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Many-objective optimization refers to optimization problems with a number of objectives considerably larger than two or three. In this paper, a study on the performance of the Fast...
Mario Köppen, Kaori Yoshida
ATMOS
2007
129views Optimization» more  ATMOS 2007»
15 years 8 months ago
Solving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
DBSEC
2008
136views Database» more  DBSEC 2008»
15 years 8 months ago
An Opinion Model for Evaluating Malicious Activities in Pervasive Computing Systems
Pervasive computing applications typically involve cooperation among a number of entities spanning multiple organizations. Any security breach in any single entity can have very fa...
Indrajit Ray, Nayot Poolsappasit, Rinku Dewri
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 6 months ago
Exchange of Limits: Why Iterative Decoding Works
We consider communication over a family of binary-input memoryless output-symmetric channels using lowdensity parity-check codes under message passing decoding. The asymptotic (in ...
Satish Babu Korada, Rüdiger L. Urbanke