Sciweavers

1763 search results - page 323 / 353
» A Formalization of Polytime Functions
Sort
View
184
Voted
POPL
2009
ACM
15 years 10 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge
88
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
15 years 10 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
68
Voted
CHI
2005
ACM
15 years 10 months ago
Towards knowledge building in professional groups
In this submission for the CHI05 Development forum, I reflect on my experience leading the Experience Design community of interest of the American Institute of Graphic Arts and su...
John Zapolski