903 search results - page 108 / 181 » Non-well-founded trees in categories |
141
click to vote
RSFDGRC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Discovering diverse individual accessing behaviors in web environment is required before mining the valuable patterns from behaviors of groups of visitors. In this paper,...
134
click to vote
SEKE
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present a new view on the data preparation in web usage mining. We concentrate on recovering individual usage behaviour from accessing records on web site. We de...
138
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
This paper investigates the issues in polyphonic popular song retrieval. The problems that we consider include singing voice extraction, melodic curve representation, and database...
155
click to vote
PASTE
2004
ACM
15 years 11 months ago
2004
ACM
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
153
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...