Sciweavers

471 search results - page 31 / 95
» On the Relative Dominance of Paging Algorithms
Sort
View
CODES
2008
IEEE
14 years 11 months ago
Profiling of lossless-compression algorithms for a novel biomedical-implant architecture
In view of a booming market for microelectronic implants, our ongoing research work is focusing on the specification and design of a novel biomedical microprocessor core targeting...
Christos Strydis, Georgi Gaydadjiev
VLDB
2000
ACM
125views Database» more  VLDB 2000»
15 years 1 months ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...
LREC
2008
159views Education» more  LREC 2008»
14 years 11 months ago
Corpus Exploitation from Wikipedia for Ontology Construction
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
Gaoying Cui, Qin Lu, Wenjie Li, Yi-Rong Chen
SIGIR
2008
ACM
14 years 9 months ago
Separate and inequal: preserving heterogeneity in topical authority flows
Web pages, like people, are often known by others in a variety of contexts. When those contexts are sufficiently distinct, a page's importance may be better represented by mu...
Lan Nie, Brian D. Davison
DAM
2010
137views more  DAM 2010»
14 years 10 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...