1308 search results - page 47 / 262 » Let's Have a Conversation |
CSCW
2012
ACM
13 years 6 months ago
2012
ACM
Recent advances in ubiquitous technology have greatly changed the way people stay connected. We conducted an in-depth video shadowing study to observe how close-knit groups use al...
CW
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper addresses interactive function-based shape modeling where relatively small formulas are used rather than thousands of polygons. Interactive modification of the function...
COMBINATORICA
2008
14 years 11 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
ENDM
2008
14 years 11 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
STOC
2002
ACM
15 years 11 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...