Sciweavers

3702 search results - page 235 / 741
» All Pairings Are in a Group
Sort
View
CP
2003
Springer
15 years 12 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
GLOBECOM
2009
IEEE
15 years 10 months ago
Design and Provisioning of WDM Networks for Many-to-Many Traffic Grooming
A large number of network applications today allow several users to interact together using the many-to-many service mode. A many-to-many session consists of group of users (we ref...
Mohammad A. Saleh, Ahmed E. Kamal
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 10 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
NETWORKING
2008
15 years 8 months ago
Cooperative Replication in Content Networks with Nodes under Churn
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...
CLEF
2010
Springer
15 years 7 months ago
The Wroclaw University of Technology Participation at ImageCLEF 2010 Photo Annotation Track
Abstract. In this paper we present three methods for image autoannotation used by the Wroclaw University of Technology group at ImageCLEF 2010 Photo Annotation track. All of our ex...
Michal Stanek, Oskar Maier, Halina Kwasnicka