Sciweavers

8025 search results - page 389 / 1605
» Combinators Introduction: An Algorithm
Sort
View
228
Voted
PODC
2012
ACM
13 years 9 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
183
Voted
ECCV
2006
Springer
16 years 8 months ago
Background Cut
Abstract. In this paper, we introduce background cut, a high quality and realtime foreground layer extraction algorithm. From a single video sequence with a moving foreground objec...
Jian Sun, Weiwei Zhang, Xiaoou Tang, Heung-Yeung S...
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
175
Voted
ICANNGA
2007
Springer
149views Algorithms» more  ICANNGA 2007»
16 years 1 months ago
Using Real-Valued Meta Classifiers to Integrate and Contextualize Binding Site Predictions
Currently the best algorithms for transcription factor binding site predictions are severely limited in accuracy. However, a non-linear combination of these algorithms could improv...
Mark Robinson, Offer Sharabi, Yi Sun, Rod Adams, R...
185
Voted
WWW
2005
ACM
16 years 12 days ago
Finding the boundaries of information resources on the web
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
Pavel Dmitriev, Carl Lagoze, Boris Suchkov