Search

Derik B Stenerson

from Redmond, WA
Age ~56
Get Report
Also known as:
Stenerson Stenerson
Phone and address:
15111 110Th St, Redmond, WA 98052
(425) 883-0355
Related to:
Showalter Paisley, 30David J Ackland, 55Kara M Stenerson, 59John R Ackland, 80Sheila A Ackland, 79Julie A Stenerson, 57Donna M Stenerson, 43Ian J Stenerson, 29Richard O Stenerson, 88
Connected to:
Annie M Stenersen, 41Audrey R Stenerson, 61Dale R Stenerson, 89Eivind Stenersen, 60Eric J Stenerson, 57Jaclyn A Stenerson, 37John M Stenersen, 55Lynette J Stenersen, 48Sandra Stenerson, 39Terri M Stenerson, 76

Derik Stenerson Phones & Addresses

  • 15111 110Th St, Redmond, WA 98052 (425) 883-0355
  • 15111 110Th Pl, Redmond, WA 98052 (425) 883-0355
  • 7845 235Th Ave, Redmond, WA 98053 (425) 898-8322
  • 12210 24Th St, Bellevue, WA 98005 (425) 883-0355
  • Kiona, WA

Skills

Microsoft CRM • Cloud Computing • JavaScript • Software Project Management • SaaS • Microsoft Dynamics • Agile Methodologies • Enterprise Software • Program Management • Agile Project Management • Software Development • SharePoint • Scrum • Partner Management • Business Intelligence • Microsoft Technologies • Online Services • Product Management • C# • Software Design • Software Engineering • Release Management • Strategic planning & envisioning • Value proposition development • Scenario-focused engineering • User experience & interaction design • User and usability research • People development, coaching • Team building & recruiting

Industries

Computer Software

Resumes

Resumes

Derik Stenerson Photo 1

Derik Stenerson

View page
Location:
Greater Seattle Area
Industry:
Computer Software
Skills:
Microsoft CRM
Cloud Computing
JavaScript
Software Project Management
SaaS
Microsoft Dynamics
Agile Methodologies
Enterprise Software
Program Management
Agile Project Management
Software Development
SharePoint
Scrum
Partner Management
Business Intelligence
Microsoft Technologies
Online Services
Product Management
C#
Software Design
Software Engineering
Release Management
Strategic planning & envisioning
Value proposition development
Scenario-focused engineering
User experience & interaction design
User and usability research
People development, coaching
Team building & recruiting

Publications

Us Patents

Creating Ad Hoc Relationships Between Entities

View page
US Patent:
8468170, Jun 18, 2013
Filed:
Dec 15, 2008
Appl. No.:
12/335197
Inventors:
Andrew Bybee - Kirkland WA, US
Derik Stenerson - Redmond WA, US
Denis Seniuc - Bellevue WA, US
Kalmadi Santhosh Rao - Redmond WA, US
Shashi Ranjan - Redmond WA, US
Assignee:
Microsoft - Redmond WA
International Classification:
G06F 17/30
US Classification:
707793, 707706, 707713, 707722, 707736, 707758, 707781, 707792, 707797, 707798, 707799, 707800, 707801, 707802
Abstract:
Users are enabled to quickly and easily associate records representing entities such as themselves, other users, contacts, accounts, teams/groups, and similar ones employing a record of the association and assign each entity a role or other attributes as a part of this association. Relationship records and attributes preserving entity association information allow teamwork, communication, and collaboration for effective management of business processes. The records and attributes also enable visualization and facilitate deeper understanding of the relationships between people, data, and business processes.

Managing Recurring Appointments

View page
US Patent:
8577959, Nov 5, 2013
Filed:
Jul 1, 2010
Appl. No.:
12/828355
Inventors:
Prabhat Kumar Pandey - Hyderabad, IN
Abhishek Kumar Gupta - Hyderabad, IN
Sandhya Vankamamidi - Hyderabad, IN
Sutirtha Saha - Hyderabad, IN
Kulo Rajasekaran - Hyderabad, IN
David Robert Shutt - Seattle WA, US
Derik Bjorn Stenerson - Redmond WA, US
Niraj Yadav - Hyderabad, IN
Ramesh Prasad Pandey - Uttar Pradesh, IN
Sharad Sharma - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/16
US Classification:
709203
Abstract:
Concepts and technologies are described herein for managing recurring appointments without losing historical data associated with the recurring appointments. In accordance with the concepts and technologies disclosed herein, a recurring appointment definition can be modified without deleting the recurring appointment definition and/or losing exceptions, notes, and/or other data associated with the recurring appointment definition. Additionally, the concepts and technologies disclosed herein allow the modification of an existing recurring appointment definition without creating a new recurring appointment definition. Thus, synchronization between rules-based calendaring applications and expansion-based calendaring applications can be accomplished without creating multiple instances of related recurring appointments created due to modifications of the recurring appointment definition.

Calendar Rule Definition, Ranking, And Expansion

View page
US Patent:
20060149609, Jul 6, 2006
Filed:
Dec 30, 2004
Appl. No.:
11/026469
Inventors:
Derik Stenerson - Redmond WA, US
Ilya Baimetov - Redmond WA, US
Ehud Pardo - Bellevue WA, US
Michael Ott - Redmond WA, US
Stanislav Chiknavaryan - Redmond WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/46
US Classification:
705008000
Abstract:
The method may include providing at least one primary calendar, providing a plurality of calendar rules, each of the plurality of rules comprising a rank and a rule-scope. The method may also include providing a representation of the primary calendar and the plurality of calendar rules, and allowing expansion of the representation of the plurality of calendar rules.

Visual Representation Of Sub-Intervals Of Time

View page
US Patent:
20060149610, Jul 6, 2006
Filed:
Dec 30, 2004
Appl. No.:
11/026718
Inventors:
Derik Stenerson - Redmond WA, US
Ehud Pardo - Bellevue WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/46
US Classification:
705008000
Abstract:
The method may include creating a first time span where a time span comprises a start time, an end time and an attribute, creating a second time span; wherein the end time of the first time span and the start time of the second time span are set according to an adjustment rule, allowing modification of the start times and end times, if the end time of the first time span has been modified, automatically adjusting the start time of the second time span according to the adjustment rule and if the start time of the second time span has been modified, automatically adjusting the end time of the first time span according to the adjustment rule.

Business Process Assistance Wizard

View page
US Patent:
20070185747, Aug 9, 2007
Filed:
Feb 7, 2006
Appl. No.:
11/348562
Inventors:
Prashant Gupta - Rajasthan, IN
Abhijit Gore - Mumbai, IN
Amit Kumar - Agra, IN
Kulothungan Rajasekaran - Hyderabad, IN
Derik Stenerson - Redmond WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/44
US Classification:
705007000
Abstract:
A business process guide may assist tracking and updating business processes, such as marketing business processes. The business processes may be part of a customer relationship management system. High level business process elements may be displayed which may be selected to display additional information about the elements.

Sequential And Non-Sequential Access To Records Within A List

View page
US Patent:
20110314395, Dec 22, 2011
Filed:
Jun 17, 2010
Appl. No.:
12/817186
Inventors:
Derik Bjorn Stenerson - Redmond WA, US
Karin Zimprich - Bellevue WA, US
Bharath Swaminathan - Renton WA, US
Gautam Satalkar - Redmond WA, US
Ted Cyrek - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 3/048
US Classification:
715760, 715781
Abstract:
The disclosure provided herein allows a user of a web application to sequentially or non-sequentially open records from a single or multi-page list across page boundaries without leaving the current viewing window. According to one aspect, a list is provided having a number of records presented sequentially in one or more pages of a list. A selection of one of the records is received, and the content associated with the selected record is retrieved and provided. The list is again provided while presenting the content of the selected record. A new record, sequentially or non-sequentially listed with respect to the currently viewed record, is selected from the list, and in response to the selection, the content within the viewing window is replaced with content associated with the newly selected record.

Resource-Based Capacity Scheduling System

View page
US Patent:
7676391, Mar 9, 2010
Filed:
Jun 30, 2003
Appl. No.:
10/609991
Inventors:
Dan Grunspan - Bellevue WA, US
Ehud Pardo - Bellevue WA, US
Derik Stenerson - Redmond WA, US
Tobin Zerba - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06Q 10/00
US Classification:
705 8
Abstract:
The present invention describes the scheduling requirements if a business to an automatic scheduling system in a way which allows efficient automatic scheduling of appointments for resources of the business. In one embodiment, the scheduling system schedules the resources based not only on total capacity, but based on how many appointments can be initiated at a given time.

Smart Find For In-Application Searching

View page
US Patent:
20210319068, Oct 14, 2021
Filed:
Apr 13, 2020
Appl. No.:
16/847622
Inventors:
- Redmond WA, US
Bernhard KOHLMEIER - Seattle WA, US
Xiaosong YANG - Bellevue WA, US
Le YU - Kenmore WA, US
Lin SONG - Sammamish WA, US
Hao MI - Redmond WA, US
Derik Bjorn STENERSON - Redmond WA, US
Seok Woo John KIM - Bellevue WA, US
Robyn SAMBO - Redmond WA, US
International Classification:
G06F 16/9032
G06N 20/00
G06F 16/903
G06F 16/93
Abstract:
An in-application search service receives a query from a user attempting to locate information within a document. If a current index and current vector table do not exist, a content indexing service produces an index and a vector table based on the current content of the document. The vector table is based on semantic models that have been pre-trained. The query is tokenized and one of three different processing paths are taken based on the length of the tokenized query. For a single term query, a semantic search and prefix search are performed and the results are combined. If the length of tokenized query exceeds a threshold, a semantic search produces the results. Otherwise, search results are produced based on both prefix fanout and semantic fanout. Results are deduplicated, snippets are extracted, and the results and/or snippets are presented to the user.
Control profile
Derik B Stenerson from Redmond, WA, age ~56 Get Report