Sciweavers

3466 search results - page 599 / 694
» Fast computation of special resultants
Sort
View
103
Voted
CVIU
2004
134views more  CVIU 2004»
15 years 19 days ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
92
Voted
PVLDB
2010
110views more  PVLDB 2010»
14 years 11 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
94
Voted
TCS
2010
14 years 11 months ago
Incremental learning with temporary memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model co...
Sanjay Jain, Steffen Lange, Samuel E. Moelius, San...
106
Voted
QEST
2010
IEEE
14 years 10 months ago
A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue
Abstract--In this paper we study a broad class of semiMarkovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue an...
Benny Van Houdt
95
Voted
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 10 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...