Sciweavers

1170 search results - page 90 / 234
» How Fast Is Too Fast
Sort
View
FCCM
2004
IEEE
141views VLSI» more  FCCM 2004»
15 years 6 months ago
Deep Packet Filter with Dedicated Logic and Read Only Memories
Searching for multiple string patterns in a stream of data is a computationally expensive task. The speed of the search pattern module determines the overall performance of deep p...
Young H. Cho, William H. Mangione-Smith
AAAI
2008
15 years 5 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao
AVI
2008
15 years 5 months ago
TapTap and MagStick: improving one-handed target acquisition on small touch-screens
We present the design and evaluation of TapTap and MagStick, two thumb interaction techniques for target acquisition on mobile devices with small touch-screens. These two techniqu...
Anne Roudaut, Stéphane Huot, Eric Lecolinet
CIDR
2007
100views Algorithms» more  CIDR 2007»
15 years 4 months ago
Database Cracking
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
LREC
2010
179views Education» more  LREC 2010»
15 years 4 months ago
Appraise: An Open-Source Toolkit for Manual Phrase-Based Evaluation of Translations
We describe a focused effort to investigate the performance of phrase-based, human evaluation of machine translation output achieving a high annotator agreement. We define phrase-...
Christian Federmann