Sciweavers

379 search results - page 49 / 76
» Strong reducibility of partial numberings
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 9 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 4 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
RTCSA
2009
IEEE
14 years 4 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
ICCD
2008
IEEE
160views Hardware» more  ICCD 2008»
14 years 4 months ago
An improved micro-architecture for function approximation using piecewise quadratic interpolation
We present a new micro-architecture for evaluating functions based on piecewise quadratic interpolation. The micro-architecture consists mainly of a look-up table and two multiply...
Shai Erez, Guy Even