会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • OBJECT ACCESS SYSTEM BASED UPON HIERARCHICAL EXTRACTION TREE AND RELATED METHODS
    • 基于分层提取树的对象访问系统及相关方法
    • US20120254197A1
    • 2012-10-04
    • US13431257
    • 2012-03-27
    • Yevgeniy KUZMIN
    • Yevgeniy KUZMIN
    • G06F17/30
    • G06F17/30961G06F3/04883G06F3/04886
    • An object access system may include an input component, and a processor coupled to the input component and configured to construct an extraction tree based upon an ordered list of objects, each object having an object description and associated weighted value. The extraction tree may include nodes, each node having a node range for representing a group of objects based upon the respective object descriptions. The nodes may include a parent node, and ordered child nodes associated therewith and having overlapping node ranges. The processor may be configured to traverse the extraction tree, based upon user input from the input component, along an access path from a root node to a terminal node including a selected access object.
    • 对象访问系统可以包括输入组件和耦合到输入组件并被配置为基于对象的有序列表构建提取树的处理器,每个对象具有对象描述和相关联的加权值。 提取树可以包括节点,每个节点具有用于基于相应对象描述来表示对象组的节点范围。 节点可以包括父节点,以及与其相关联并具有重叠节点范围的有序子节点。 处理器可以被配置为沿着从根节点到包括所选访问对象的终端节点的访问路径,基于来自输入组件的用户输入遍历提取树。
    • 2. 发明申请
    • Input guessing systems, methods, and computer program products
    • 输入猜测系统,方法和计算机程序产品
    • US20070016862A1
    • 2007-01-18
    • US11487269
    • 2006-07-14
    • Yevgeniy Kuzmin
    • Yevgeniy Kuzmin
    • G06F3/00
    • G06F3/0237G06F3/0236G06F3/0482
    • Provided are systems for acceleration of text input for electronic devices, such as efficient and user-friendly input guessing systems for mobile phones. An input guessing system disambiguates user input to decrease the number of required key strokes for entry of desired input. An input guessing system uses one or more of optimal selection of a candidate word and position of the cursor within or after the candidate word based on minimization of expectation of the total weighted number of input events for all words, advanced disambiguating of input events, reduced ambiguity of a group containing a letter in a current position of the cursor, smart processing of word endings, advanced delimiting of words using an OK key, automatic addition of spaces, simple error correction, the ability to generate words with embedded special accented characters by typing the key associated with the unaccented version of the letter, and the ability to automatically disambiguate among multiple punctuation characters assigned to a single key based on the context of the keystroke to accelerate and simplify user input.
    • 提供了用于加速电子设备的文本输入的系统,例如用于移动电话的高效和用户友好的输入猜测系统。 输入猜测系统消除用户输入以减少输入所需输入的所需键击次数。 输入猜测系统使用基于对所有单词的输入事件的总加权数量的期望的最小化,输入事件的高级消除歧义的减少的候选词的最佳选择候选词和光标的位置中的一个或多个来选择候选词和位置 包含光标当前位置中的字母的组的歧义,智能处理单词结尾,使用OK键对字进行高级定界,自动添加空格,简单纠错,通过嵌入的特殊重音字符生成单词的能力 键入与该字母的未加密版本相关联的键,以及基于该键击的上下文自动消除分配给单个键的多个标点符号之间的加速和简化用户输入的能力。
    • 3. 发明授权
    • Object access system based upon hierarchical extraction tree and related methods
    • 基于层次提取树和相关方法的对象访问系统
    • US08788508B2
    • 2014-07-22
    • US13431257
    • 2012-03-27
    • Yevgeniy Kuzmin
    • Yevgeniy Kuzmin
    • G06F17/30
    • G06F17/30961G06F3/04883G06F3/04886
    • An object access system may include an input component, and a processor coupled to the input component and configured to construct an extraction tree based upon an ordered list of objects, each object having an object description and associated weighted value. The extraction tree may include nodes, each node having a node range for representing a group of objects based upon the respective object descriptions. The nodes may include a parent node, and ordered child nodes associated therewith and having overlapping node ranges. The processor may be configured to traverse the extraction tree, based upon user input from the input component, along an access path from a root node to a terminal node including a selected access object.
    • 对象访问系统可以包括输入组件和耦合到输入组件并被配置为基于对象的有序列表构建提取树的处理器,每个对象具有对象描述和相关联的加权值。 提取树可以包括节点,每个节点具有用于基于相应对象描述来表示对象组的节点范围。 节点可以包括父节点,以及与其相关联并具有重叠节点范围的有序子节点。 处理器可以被配置为沿着从根节点到包括所选访问对象的终端节点的访问路径,基于来自输入组件的用户输入遍历提取树。
    • 4. 发明授权
    • Color distribution for texture and image compression
    • 纹理和图像压缩的颜色分布
    • US07397946B2
    • 2008-07-08
    • US10764314
    • 2004-01-23
    • Alexander ReshetovYevgeniy KuzminDenis Ivanoy
    • Alexander ReshetovYevgeniy KuzminDenis Ivanoy
    • G06K9/00
    • H04N1/644G06T9/005G06T11/001
    • A block decomposition based method is provided for compressing textures based on sharing color information between texture blocks. The texture map is divided into a plurality of texture blocks containing texels. During compression a first color value is stored for a first block and a second color value is stored for a second block. A palette is created for each texture block using the color values stored for several neighboring texture blocks. Each texel in each of the texture blocks is indexed to one of the colors in the palette. Accordingly the method compresses the information in the texture map by storing for each texture block bits representing a color value and bits to index each of the texels to a color in the palette, which allows sharing of color information between blocks. During decompression the palettes are regenerated and colors from the palette are assigned to the texels according to the stored index values. Accordingly, the decompression of the texture allows regeneration of the compressed texture, which may be mapped to surfaces to improve the visual quality of three-dimensional graphics.
    • 提供了基于块分解的方法,用于基于在纹理块之间共享颜色信息来压缩纹理。 纹理贴图被分成包含纹素的多个纹理块。 在压缩期间,为第一块存储第一颜色值,并且为第二块存储第二颜色值。 使用为几个相邻纹理块存储的颜色值为每个纹理块创建调色板。 每个纹理块中的每个纹素都被索引到调色板中的一种颜色。 因此,该方法通过存储表示颜色值的每个纹理块位和将每个纹理像素索引到调色板中的颜色的位置来压缩纹理映射中的信息,这允许在块之间共享颜色信息。 在解压缩期间,调色板被再生,并且调色板中的颜色根据存储的索引值被分配给纹素。 因此,纹理的解压缩允许压缩纹理的再生,其可以映射到表面以改善三维图形的视觉质量。
    • 5. 发明授权
    • Color distribution for texture and image compression
    • 纹理和图像压缩的颜色分布
    • US06819793B1
    • 2004-11-16
    • US09607669
    • 2000-06-30
    • Alexander ReshetovYevgeniy KuzminDenis Ivanov
    • Alexander ReshetovYevgeniy KuzminDenis Ivanov
    • G06K900
    • H04N1/644G06T9/005G06T11/001
    • A block decomposition based method is provided for compressing textures based on sharing color information between texture blocks. The texture map is divided into a plurality of texture blocks containing texels. During compression a first color value is stored for a first block and a second color value is stored for a second block. A palette is created for each texture block using the color values stored for several neighboring texture blocks. Each texel in each of the texture blocks is indexed to one of the colors in the palette. Accordingly the method compresses the information in the texture map by storing for each texture block bits representing a color value and bits to index each of the texels to a color in the palette, which allows sharing of color information between blocks. During decompression the palettes are regenerated and colors from the palette are assigned to the texels according to the stored index values. Accordingly, the decompression of the texture allows regeneration of the compressed texture, which may be mapped to surfaces to improve the visual quality of three-dimensional graphics.
    • 提供了基于块分解的方法,用于基于在纹理块之间共享颜色信息来压缩纹理。 纹理贴图被分成包含纹素的多个纹理块。 在压缩期间,为第一块存储第一颜色值,并且为第二块存储第二颜色值。 使用为几个相邻纹理块存储的颜色值为每个纹理块创建调色板。 每个纹理块中的每个纹素都被索引到调色板中的一种颜色。 因此,该方法通过存储表示颜色值的每个纹理块位和将每个纹理像素索引到调色板中的颜色的位置来压缩纹理映射中的信息,这允许在块之间共享颜色信息。 在解压缩期间,调色板被再生,并且调色板中的颜色根据存储的索引值被分配给纹素。 因此,纹理的解压缩允许压缩纹理的再生,其可以映射到表面以改善三维图形的视觉质量。