Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Druck
Asher Druck, Nahariya IL
| Patent application number | Description | Published |
|---|---|---|
| 20090100198 | ADDRESSING MULTIPLE DEVICES ON A SHARED BUS - Assigning addresses to legacy sharing at least one signal line with a plurality of client devices. Each of the devices includes a number of I/O pins selected ones of which are connected to the at least one signal line and each client device includes a first and a second initialization pin. In the described embodiment, all but a first one of the plurality of client devices are connected to one another in a daisy chain arrangement by way of the first and the second initialization pin separate from the signal line. A first client device has a first initialization pin that is independently held at a first logic level and a second initialization pin that is connected to the daisy chain arrangement. The first one of the client devices is initialized and, in turn, triggers initialization of the daisy chained client devices. The legacy device is initialized separately from the client devices. | 04-16-2009 |
| 20090106469 | SIGNALING AN INTERRUPT REQUEST THROUGH DAISY CHAINED DEVICES - A system and a method for asynchronously signaling interrupts from a plurality of devices in a computing system, while optimizing the latencies in handling the interrupts. In a particular embodiment, an interrupt is signaled via a plurality of daisy chained devices by handing over the interrupt request from one device to another while retaining information regarding any interrupts handed over (also referred to as passed). In this way, the interrupt source can be readily identified (using a binary search, for example) thereby reducing interrupt latency and memory resources required to retain interrupt history. | 04-23-2009 |
Gregory Druck, Northampton, MA US
| Patent application number | Description | Published |
|---|---|---|
| 20080256007 | Learning A* priority function from unlabeled data - A technique for increasing efficiency of inference of structure variables (e.g., an inference problem) using a priority-driven algorithm rather than conventional dynamic programming. The technique employs a probable approximate underestimate which can be used to compute a probable approximate solution to the inference problem when used as a priority function (“a probable approximate underestimate function”) for a more computationally complex classification function. The probable approximate underestimate function can have a functional form of a simpler, easier to decode model. The model can be learned from unlabeled data by solving a linear/quadratic optimization problem. The priority function can be computed quickly, and can result in solutions that are substantially optimal. Using the priority function, computation efficiency of a classification function (e.g., discriminative classifier) can be increased using a generalization of the A* algorithm. | 10-16-2008 |
Philip Druck, Englewood, NJ US
| Patent application number | Description | Published |
|---|---|---|
| 20090244395 | N DIMENSIONAL NON-LINEAR, STATIC, ADAPTIVE DIGITAL FILTER DESIGN USING D SCALE NON-UNIFORM SAMPLING - The present invention is a filter design that extracts information from a signal by employing D scale nonuniform sampling. In one embodiment a D scale multiresolution sampler, filter bank router, filter bank sampler controller, phase shifter, and consolidator constitute a maximal arrangement for a D scale FIR/IIR filter design. | 10-01-2009 |