Sciweavers

5595 search results - page 889 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
KDD
2005
ACM
151views Data Mining» more  KDD 2005»
16 years 7 months ago
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Temporal Text Mining (TTM) is concerned with discovering temporal patterns in text information collected over time. Since most text information bears some time stamps, TTM has man...
Qiaozhu Mei, ChengXiang Zhai
ICCAD
2008
IEEE
138views Hardware» more  ICCAD 2008»
16 years 3 months ago
Fault tolerant placement and defect reconfiguration for nano-FPGAs
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...
Amit Agarwal, Jason Cong, Brian Tagiku
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 5 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
MOBIHOC
2003
ACM
16 years 6 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...