Sciweavers

514 search results - page 43 / 103
» Approximate Periods of Strings
Sort
View
112
Voted
ICML
2010
IEEE
15 years 1 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
91
Voted
ICSM
2002
IEEE
15 years 5 months ago
Evaluating Context-Sensitive Slicing and Chopping
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
Jens Krinke
79
Voted
CHI
1993
ACM
15 years 4 months ago
Pictographic naming
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...
Daniel P. Lopresti, Andrew Tomkins
90
Voted
MJ
2006
138views more  MJ 2006»
15 years 13 days ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
80
Voted
COCOON
2010
Springer
15 years 5 months ago
Detecting Areas Visited Regularly
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson