Sciweavers

230 search results - page 32 / 46
» Data Structures for Restricted Triangular Range Searching
Sort
View
AINA
2009
IEEE
15 years 4 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 1 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»
15 years 10 months 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...
AAAI
2000
14 years 11 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
92
Voted
JAIR
2011
124views more  JAIR 2011»
14 years 4 months ago
Second-Order Consistencies
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
Christophe Lecoutre, Stéphane Cardon, Julie...