Sciweavers

2520 search results - page 491 / 504
» The complexity of approximating entropy
Sort
View
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 9 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
DATAMINE
2006
89views more  DATAMINE 2006»
13 years 9 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
JCP
2008
116views more  JCP 2008»
13 years 9 months ago
Sensor Location Strategy in Large-Scale Systems for Fault Detection Applications
Fault detection in large-scale systems is conducted by the use of sensors, thus the sensor location influences the performances of fault detection directly. As the scale of systems...
Fan Yang, Deyun Xiao
JMLR
2008
168views more  JMLR 2008»
13 years 9 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
JMM2
2006
212views more  JMM2 2006»
13 years 9 months ago
K-means Tracker: A General Algorithm for Tracking People
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...