Sciweavers

2742 search results - page 408 / 549
» Deriving Category Theory from Type Theory
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
14 years 9 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
CHI
2003
ACM
14 years 9 months ago
Ambiguity as a resource for design
Ambiguity is usually considered anathema in Human Computer Interaction. We argue, in contrast, that it is a resource for design that can be used to encourage close personal engage...
William W. Gaver, Jacob Beaver, Steve Benford
POPL
2008
ACM
14 years 9 months ago
Enhancing modular OO verification with separation logic
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 9 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan