Skip to search formSkip to main contentSkip to account menu

Tame

Known as: Tame.it 
Tame is an analytic research tool for Twitter, developed in 2012 by Arno Dirlam (CTO), Frederik Fischer (CEO) and Torsten Müller (CCO). Tame is a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Living on the edge: The role of proactive caching in 5G wireless networks
This article explores one of the key enablers of beyond 4G wireless networks leveraging small cell network deployments, proactive… 
Highly Cited
2013
Highly Cited
2013
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
In view of the minimization of a nonsmooth nonconvex function f, we prove an abstract convergence result for descent methods… 
Highly Cited
2007
Highly Cited
2007
Communication Power and Counter-power in the Network Society
A bookmark for marking a page and line in a book. The bookmark includes an elongated planar body having an upper terminal portion… 
Highly Cited
2007
Highly Cited
2007
Distinguished tame supercuspidal representations
In these notes, we describe some examples of distinguished tame supercuspidal representations of reductive p-adic groups. We also… 
Highly Cited
2003
Highly Cited
2003
The tame and the wild automorphisms of polynomial rings in three variables
Let C = F [x1, x2, . . . , xn] be the polynomial ring in the variables x1, x2, . . . , xn over a field F , and let AutC be the… 
Highly Cited
2001
Highly Cited
2001
Construction of tame supercuspidal representations
  • J. Yu
  • 2001
  • Corpus ID: 9092161
The notion of depth is defined by Moy-Prasad [MP2]. The notion of a generic character will be defined in §9. When G = GLn or G is… 
Highly Cited
2001
Highly Cited
2001
Tame and Wild Projective Curves and Classification of Vector Bundles
Abstract We propose a new method of classifying vector bundles on projective curves, especially singular ones, according to their… 
Highly Cited
1999
Highly Cited
1999
Mission Improbable: Using Fantasy Documents to Tame Disaster
This text examines actual attempts to "prepare" for catastrophes and finds that the policies adopted by corporations and… 
Highly Cited
1998
Highly Cited
1998
Tame Topology and O-minimal Structures
1. Some elementary results 2. Semialgebraic sets 3. Cell decomposition 4. Definable invariants: Dimension and Euler… 
Highly Cited
1989
Highly Cited
1989
On a theory of computation and complexity over the real numbers; np-completeness
. We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)