359 search results - page 61 / 72 » The Parameterized Complexity of Counting Problems |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
This paper proposes the integration of semantic information drawn from a web application’s domain knowledge into all phases of the web usage mining process (preprocessing, patte...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider opportunistic spectrum access for secondary users over multiple channels whose occupancy by primary users is modeled as discrete-time Markov processes. Due to hardware...
ISCA
2003
IEEE
14 years 24 days ago
2003
IEEE
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
SMA
2003
ACM
14 years 23 days ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...