4536 search results - page 312 / 908 » Contention-Sensitive Data Structures and Algorithms |
176
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
209
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
187
click to vote
EUROCAST
2005
Springer
16 years 8 days ago
2005
Springer
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...
179
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
188
click to vote
ICDM
2006
IEEE
16 years 24 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...