Sciweavers

1712 search results - page 333 / 343
» A Computational Approach to Binding Theory
Sort
View
DAC
2006
ACM
16 years 2 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
WWW
2007
ACM
16 years 2 months ago
Answering bounded continuous search queries in the world wide web
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
Dirk Kukulenz, Alexandros Ntoulas
WWW
2003
ACM
16 years 2 months ago
Presentation Dynamism in XML Functional Programming meets SMIL Animation
The move towards a semantic web will produce an increasing number of presentations whose creation is based upon semantic queries. Intelligent presentation generation engines have ...
Patrick Schmitz, Simon J. Thompson, Peter R. King
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 1 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 1 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...