Sciweavers

514 search results - page 43 / 103
» Approximate Periods of Strings
Sort
View
ICML
2010
IEEE
13 years 9 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
ICSM
2002
IEEE
14 years 27 days 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
CHI
1993
ACM
14 years 2 days 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
MJ
2006
138views more  MJ 2006»
13 years 8 months 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
COCOON
2010
Springer
14 years 24 days 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