Sciweavers

14382 search results - page 2618 / 2877
» Time in Connectionist Models
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 8 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 8 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
SIGGRAPH
1993
ACM
15 years 8 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
ACMICEC
2007
ACM
145views ECommerce» more  ACMICEC 2007»
15 years 8 months ago
Advance selling and internet intermediary: travel distribution strategies in the e-commerce age
We investigate two challenges advance of e-commerce creates for traditional practice of travel distribution. First, we explore whether travel providers benefit from strategically ...
Zhe Qu
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 7 months ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard
« Prev « First page 2618 / 2877 Last » Next »