Sciweavers

3702 search results - page 136 / 741
» All Pairings Are in a Group
Sort
View
CP
2008
Springer
15 years 8 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
VLDB
1994
ACM
120views Database» more  VLDB 1994»
15 years 10 months ago
Indexing Multiple Sets
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
Christoph Kilger, Guido Moerkotte
CVPR
2001
IEEE
16 years 8 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia
CSCW
2002
ACM
15 years 6 months ago
What is chat doing in the workplace?
We report an empirical study of a synchronous messaging application with group-oriented functionality designed to support teams in the workplace. In particular, the tool supports ...
Mark Handel, James D. Herbsleb
CVPR
2006
IEEE
16 years 16 days ago
Nonlinear Mean Shift for Clustering over Analytic Manifolds
The mean shift algorithm is widely applied for nonparametric clustering in Euclidean spaces. Recently, mean shift was generalized for clustering on matrix Lie groups. We further e...
Raghav Subbarao, Peter Meer