Sciweavers

289 search results - page 13 / 58
» Teaching data structure design patterns
Sort
View
COLING
2002
13 years 7 months ago
Probabilistic Models of Verb-Argument Structure
We evaluate probabilistic models of verb argument structure trained on a corpus of verbs and their syntactic arguments. Models designed to represent patterns of verb alternation b...
Daniel Gildea
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 7 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 1 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
CONEXT
2009
ACM
13 years 8 months ago
MDCube: a high performance network structure for modular data center interconnection
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
Haitao Wu, Guohan Lu, Dan Li, Chuanxiong Guo, Yong...
COMPSAC
2002
IEEE
14 years 13 days ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen