Sciweavers

7379 search results - page 1175 / 1476
» How Many Clusters
Sort
View
TCS
2008
15 years 4 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
IPM
2007
86views more  IPM 2007»
15 years 4 months ago
Document concept lattice for text understanding and summarization
We argue that the quality of a summary can be evaluated based on how many concepts in the original document(s) that reserved after summarization. Here, a concept refers to an abst...
Shiren Ye, Tat-Seng Chua, Min-Yen Kan, Long Qiu
TFS
2008
116views more  TFS 2008»
15 years 4 months ago
Fuzzifying Allen's Temporal Interval Relations
When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper, we propose a framework to represent, compute, and re...
Steven Schockaert, Martine De Cock, Etienne E. Ker...
TKDE
2008
154views more  TKDE 2008»
15 years 4 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...
TKDE
2008
126views more  TKDE 2008»
15 years 4 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...
« Prev « First page 1175 / 1476 Last » Next »