Sciweavers

184 search results - page 27 / 37
» Cache-oblivious data structures for orthogonal range searchi...
Sort
View
WWW
2009
ACM
16 years 12 days ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...
AINA
2009
IEEE
15 years 6 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 3 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 4 days ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
3DIM
2005
IEEE
15 years 5 months ago
Automatic Burr Detection on Surfaces of Revolution Based on Adaptive 3D Scanning
This paper describes how to automatically extract the presence and location of geometrical irregularities on a surface of revolution. To this end a partial 3D scan of the workpiec...
Kasper Claes, Thomas P. Koninckx, Herman Bruyninck...