Sciweavers

5100 search results - page 1002 / 1020
» The Linear Complexity of a Graph
Sort
View
CSCLP
2008
Springer
13 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
DAGSTUHL
2007
13 years 11 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
VAMOS
2010
Springer
13 years 11 months ago
Variability in Time - Product Line Variability and Evolution Revisited
In its basic form, a variability model describes the variations among similar artifacts from a structural point of view. It does not capture any information about when these variat...
Christoph Elsner, Goetz Botterweck, Daniel Lohmann...
RIVF
2008
13 years 11 months ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...
NIPS
2007
13 years 11 months ago
A neural network implementing optimal state estimation based on dynamic spike train decoding
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
Omer Bobrowski, Ron Meir, Shy Shoham, Yonina C. El...
« Prev « First page 1002 / 1020 Last » Next »