Sciweavers

1258 search results - page 197 / 252
» Architecture-driven Problem Decomposition
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 9 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
ICDAR
2009
IEEE
14 years 3 months ago
Text Lines and Snippets Extraction for 19th Century Handwriting Documents Layout Analysis
In this paper we propose a new approach to improve electronic editions of human science corpus, providing an efficient estimation of manuscripts pages structure. In any handwriti...
Vincent Malleron, Véronique Eglin, Hubert E...
EPEW
2005
Springer
14 years 2 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
VLDB
2005
ACM
180views Database» more  VLDB 2005»
14 years 2 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
14 years 2 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...