Sciweavers

2030 search results - page 144 / 406
» Extremal Problems of Information Combining
Sort
View
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
15 years 5 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
166
Voted
CIKM
2011
Springer
14 years 5 months ago
Citation count prediction: learning to estimate future citations for literature
In most of the cases, scientists depend on previous literature which is relevant to their research fields for developing new ideas. However, it is not wise, nor possible, to trac...
Rui Yan, Jie Tang, Xiaobing Liu, Dongdong Shan, Xi...
MS
2003
15 years 6 months ago
Information-theoretic Competitive Learning
— In this paper, we propose a new supervised learning method whereby information is controlled by the associated cost in an intermediate layer, and in an output layer, errors bet...
Ryotaro Kamimura
AAAI
1993
15 years 6 months ago
Model Simplification by Asymptotic Order of Magnitude Reasoning
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...
Kenneth Man-kam Yip
CVPR
2003
IEEE
16 years 7 months ago
Robust Data Clustering
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
Ana L. N. Fred, Anil K. Jain