Search

Minos N Garofalakis

from Santa Cruz, CA
Age ~56
Get Report
Also known as:
Garofalakis Minos, Minos S, Ninos S
Connected to:
Alejandro Garofalo, 31Allison B Garofalo, 55Andrea M Garofalo, 41Angelo S Garofano, 34Anthony Garofali, 40Bobby J Garofalo, 90Brittany N Garofalo, 32Concetta M Garofalo, 94Cynthia L Garofano, 58Debora Garofalo, 60

Minos Garofalakis Phones & Addresses

  • Santa Cruz, CA
  • Santa Clara, CA
  • 25 Lucerne St, San Francisco, CA 94103
  • 46 Wildflower Ln, Morristown, NJ 07960 (973) 644-0450
  • Berkeley, CA
  • San Jose, CA
  • New Providnce, NJ

Work

Position: Production Occupations

Education

Degree: High school graduate or higher

Resumes

Resumes

Minos Garofalakis Photo 1

Minos Garofalakis

View page

Publications

Us Patents

System And Method For Constraint Based Sequential Pattern Mining

View page
US Patent:
6473757, Oct 29, 2002
Filed:
Mar 28, 2000
Appl. No.:
09/537082
Inventors:
Minos N. Garofalakis - Chatham Township NJ
Rajeev Rastogi - New Providence NJ
Kyuseok Shim - Basking Ridge NJ
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 1730
US Classification:
707 6
Abstract:
The present invention provides a method and system for sequential pattern mining with a given constraint. A Regular Expression (RE) is used for identifying the family of interesting frequent patterns. A family of methods that enforce the RE constraint to different degrees within the generating and pruning of candidate patterns during the mining process is utilized. This is accomplished by employing different relaxations of the RE constraint in the mining loop. Those sequences which satisfy the given constraint are thus identified most expeditiously.

Determination Of Physical Topology Of A Communication Network

View page
US Patent:
6697338, Feb 24, 2004
Filed:
Oct 28, 1999
Appl. No.:
09/428419
Inventors:
Yuri Breitbart - Madison NJ
Minos N. Garofalakis - Chatham NJ
Clifford Eric Martin - Martinsville NJ
Rajeev Rastogi - New Providence NJ
Srinivasan Seshadri - Basking Ridge NJ
Abraham Silberschatz - Warren NJ
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
H04L 1228
US Classification:
370254
Abstract:
Physical connectivity is determined between elements such as switches and routers in a multiple subnet communication network. Each element has one or more interfaces each of which is physically linked with an interface of another network element. Address sets are generated for each interface of the network elements, wherein members of a given address set correspond to network elements that can be reached from the corresponding interface for which the given address set was generated. The members of first address sets generated for corresponding interfaces of a given network element, are compared with the members of second address sets generated for corresponding interfaces of network elements other than the given element. A set of candidate connections between an interface of the given network element and one or more interfaces of other network elements, are determined. If more than one candidate connection is determined, connections with network elements that are in the same subnet as the given network element are eliminated from the set.

Document Descriptor Extraction Method

View page
US Patent:
7080314, Jul 18, 2006
Filed:
Jun 16, 2000
Appl. No.:
09/595719
Inventors:
Minos N. Garofalakis - Chatham Township NJ, US
Aristides Gionis - Stanford CA, US
Rajeev Rastogi - New Providence NJ, US
Srinivasan Seshadri - Basking Ridge NJ, US
Kyuseok Shim - Bedminster NJ, US
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 15/00
US Classification:
715500, 715513
Abstract:
The present invention discloses a document descriptor extraction method and system. The document descriptor extraction method and system creates a document descriptor by generalizing input sequences within a document; factoring the input sequences and generalized input sequences; and selecting a document descriptor from the input sequences, generalized sequences, and factored sequences, preferably using minimum descriptor length (MDL) principles. Novel algorithms are employed to perform the generalizing, factoring, and selecting.

System And Method For Compressing A Data Table Using Models

View page
US Patent:
7143046, Nov 28, 2006
Filed:
Dec 28, 2001
Appl. No.:
10/033199
Inventors:
Shivnath Babu - Menlo Park CA, US
Minos N. Garofalakis - Chatham Township NJ, US
Rajeev Rastogi - New Providence NJ, US
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 7/00
G06F 17/30
US Classification:
704500, 707101
Abstract:
A system for, and method of compressing a data table using models and a database management system incorporating the system or the method. In one embodiment, the system includes: (1) a table modeller that discovers data mining models with guaranteed error bounds of at least one attribute in the data table in terms of other attributes in the data table and (2) a model selector, associated with the table modeller, that selects a subset of the at least one model to form a basis upon which to compress the data table.

Sketch-Based Multi-Query Processing Over Data Streams

View page
US Patent:
7328220, Feb 5, 2008
Filed:
Dec 29, 2004
Appl. No.:
11/025211
Inventors:
Alin Dobra - Gainesville FL, US
Johannes Gehrke - Ithaca NY, US
Rajeev Rastogi - New Providence NJ, US
Minos Garofalakis - Morristown NJ, US
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 17/00
US Classification:
707101, 707 6
Abstract:
A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.

Method And Apparatus For Secure Processing Of Xml-Based Documents

View page
US Patent:
7433870, Oct 7, 2008
Filed:
Dec 27, 2004
Appl. No.:
11/022894
Inventors:
Chee-Yong Chan - Singapore, SG
Wenfei Fan - Somerset NJ, US
Minos N. Garofalakis - Morristown NJ, US
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 17/30
G06F 7/00
US Classification:
707 9, 7071041
Abstract:
Method for providing controlled access to an XML document includes defining at least one access control policy for a user of the XML document, deriving a security view of the XML document for the user based upon said access control policy and schema level processing of the XML document and translating a user query based on the security view of the XML document to an equivalent query based on the XML document. An apparatus for same includes means for defining an access control policy for a user of the XML document and means for deriving a security view of the XML document for the user based on said access control policy and schema level processing of the XML document. Also included are means for translating a user query based on the security view of the XML document to an equivalent query based on the XML document.

Processing Data-Stream Join Aggregates Using Skimmed Sketches

View page
US Patent:
7483907, Jan 27, 2009
Filed:
Dec 29, 2004
Appl. No.:
11/025578
Inventors:
Sumit Ganguly - Bhopal, IN
Minos Garofalakis - Morristown NJ, US
Rajeev Rastogi - New Providence NJ, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
G06F 17/30
US Classification:
707101, 707 2, 707 6, 707100
Abstract:
A method of estimating an aggregate of a join over data-streams in real-time using skimmed sketches, that only examines each data element once and has a worst case space requirement of O(n/J), where J is the size of the join and n is the number of data elements. The skimmed sketch is an atomic sketch, formed as the inner product of the data-stream frequency vector and a random binary variable, from which the frequency values that exceed a predetermined threshold have been skimmed off and placed in a dense frequency vector. The join size is estimated as the sum of the sub-joins of skimmed sketches and dense frequency vectors. The atomic sketches may be arranged in a hash structure so that processing a data element only requires updating a single sketch per hash table. This keeps the per-element overhead logarithmic in the domain and stream sizes.

Method For Performing Information-Preserving Dtd Schema Embeddings

View page
US Patent:
7496571, Feb 24, 2009
Filed:
Sep 30, 2004
Appl. No.:
10/955322
Inventors:
Michael Abraham Benedikt - Chicago IL, US
Minos N. Garofalakis - Morristown NJ, US
Rajeev Rastogi - New Providence NJ, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
G06F 17/30
US Classification:
707 6, 707 1, 707 2, 707 3, 707 4, 707 5, 707 7, 707101
Abstract:
Method for performing information-preserving DTD schema embeddings between a source schema when matching a source schema and a target schema. The preservation is realized by a matching process between the two schemas that finds a first string marking of the target schema, evaluates a legality of the first string marking, determines an estimated minimal cost of the first string marking and subsequently adjusts the estimated minimal cost based upon one to one mapping of source schema and target schema subcomponents.

Isbn (Books And Publications)

Data Stream Management: Processing High-speed Data Streams

View page
Author

Minos Garofalakis

ISBN #

3540286071

Control profile
Minos N Garofalakis from Santa Cruz, CA, age ~56 Get Report