Sciweavers

85 search results - page 6 / 17
» New Developments in Symmetry Breaking in Search Using Comput...
Sort
View
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
CHI
2004
ACM
14 years 7 months ago
Story lifecycle in a product development organization
This poster describes an integrated set of stories and story-based activities that we have used in product development in IBM Software Group's Lotus product organizations. We...
Majie Zeller, Sandra L. Kogan, Michael J. Muller, ...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
14 years 1 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
FOCS
1994
IEEE
13 years 11 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
CANDC
2009
ACM
13 years 11 months ago
Computational and cognitive infrastructures of stigma: empowering identity in social computing and gaming
Computing technologies such as games, social networking sites, and virtual environments often reproduce forms of social stigma encountered in everyday real life, as well as introd...
D. Fox Harrell