Sciweavers

612 search results - page 9 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
MM
2000
ACM
105views Multimedia» more  MM 2000»
15 years 2 months ago
Smart rebinning for compression of concentric mosaics
Concentric mosaics offer a quick solution to construct a virtual copy of a real environment, and navigate in the virtual environment. However, the huge amount of data associated w...
Yunnan Wu, Cha Zhang, Jin Li, Jizheng Xu
DATE
2008
IEEE
77views Hardware» more  DATE 2008»
15 years 4 months ago
Re-Examining the Use of Network-on-Chip as Test Access Mechanism
Existing work on testing NoC-based systems advocates to reuse the on-chip network itself as test access mechanism (TAM) to transport test data to/from embedded cores. While this m...
Feng Yuan, Lin Huang, Qiang Xu
AIRWEB
2005
Springer
15 years 3 months ago
An Analysis of Factors Used in Search Engine Ranking
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
Albert Bifet, Carlos Castillo, Paul-Alexandru Chir...
NAACL
2007
14 years 11 months ago
An Information Retrieval Approach to Sense Ranking
In word sense disambiguation, choosing the most frequent sense for an ambiguous word is a powerful heuristic. However, its usefulness is restricted by the availability of sense-an...
Mirella Lapata, Frank Keller
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 4 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum