Sciweavers

8486 search results - page 131 / 1698
» Ordered Enumeration Method
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 10 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
RECOMB
2005
Springer
14 years 10 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
APLAS
2006
ACM
14 years 4 months ago
Automatic Testing of Higher Order Functions
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...
Pieter W. M. Koopman, Rinus Plasmeijer
BMVC
2010
13 years 8 months ago
Weakly Supervised Object Recognition and Localization with Invariant High Order Features
High order features have been proposed to incorporate geometrical information into the "bag of feature" representation. We propose algorithms to perform fast weakly supe...
Yimeng Zhang, Tsuhan Chen
ICDE
2009
IEEE
192views Database» more  ICDE 2009»
15 years 17 min ago
Topologically Sorted Skylines for Partially Ordered Domains
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
Dimitris Sacharidis, Stavros Papadopoulos, Dimitri...