Sciweavers

68 search results - page 10 / 14
» A clustering framework based on subjective and objective val...
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 8 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
INFORMATICALT
2010
138views more  INFORMATICALT 2010»
13 years 4 months ago
Recognition of Human Emotions in Reasoning Algorithms of Wheelchair Type Robots
This paper analyses the possibilities of integrating different technological and knowledge representation techniques for the development of a framework for the remote control of mu...
Dale Dzemydiene, Antanas Andrius Bielskis, Arunas ...
ICCV
2003
IEEE
14 years 9 months ago
Entropy-of-likelihood Feature Selection for Image Correspondence
Feature points for image correspondence are often selected according to subjective criteria (e.g. edge density, nostrils). In this paper, we present a general, non-subjective crit...
Matthew Toews, Tal Arbel
IPPS
2005
IEEE
14 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
EDBT
2012
ACM
291views Database» more  EDBT 2012»
11 years 10 months ago
Relevance search in heterogeneous networks
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...
Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie...