Sciweavers

2638 search results - page 190 / 528
» Extracting Approximate Patterns
Sort
View
RTAS
2005
IEEE
16 years 15 hour ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 12 months ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
16 years 3 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
COLING
2010
15 years 1 months ago
Automated Translation of Semantic Relationships
We present a method for translating semantic relationships between languages where relationships are defined as pattern clusters. Given a pattern set which represents a semantic r...
Dmitry Davidov, Ari Rappoport
OTM
2009
Springer
15 years 11 months ago
Automatic Construction of a Semantic, Domain-Independent Knowledge Base
In this paper, we want to show which difficulties arise when automatically constructing a domain-independent knowledge base from the web. We show possible applications for such a k...
David Urbansky