Sciweavers

333 search results - page 39 / 67
» Labels from Reductions: Towards a General Theory
Sort
View
FLAIRS
2004
15 years 7 months ago
VENUS: A System for Novelty Detection in Video Streams with Learning
Novelty detection in video is a rapidly developing application domain within computer vision. The motivation behind this paper is a learning based framework for detecting novelty ...
Roger S. Gaborski, Vishal S. Vaingankar, Vineet Ch...
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 4 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
160
Voted
CPAIOR
2009
Springer
16 years 19 days ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
IHI
2010
132views Healthcare» more  IHI 2010»
15 years 27 days ago
Section classification in clinical notes using supervised hidden markov model
As more and more information is available in the Electronic Health Record in the form of free-text narrative, there is a need for automated tools, which can process and understand...
Ying Li, Sharon Lipsky Gorman, Noemie Elhadad
149
Voted
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 6 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul