Sciweavers

3702 search results - page 648 / 741
» All Pairings Are in a Group
Sort
View
DIS
2009
Springer
16 years 29 days ago
A Dialectic Approach to Problem-Solving
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a numb...
Éric Martin, Jean Sallantin
DATE
2007
IEEE
95views Hardware» more  DATE 2007»
16 years 22 days ago
Memory bank aware dynamic loop scheduling
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...
Mahmut T. Kandemir, Taylan Yemliha, Seung Woo Son,...
FOCS
2007
IEEE
16 years 22 days ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
GRC
2007
IEEE
16 years 22 days ago
Towards Mobile Internet: Location Privacy Threats and Granular Computation Challenges
The bulk of contents out on the Internet continue to grow at an astounding pace. As computing and communications become ubiquitous, we are entering the Mobile Internet Computing e...
Ling Liu
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
16 years 21 days ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy