Sciweavers

2745 search results - page 289 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
DCC
2004
IEEE
16 years 4 months ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper
NIPS
2008
15 years 6 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
CVPR
2008
IEEE
16 years 7 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
135
Voted
GRAPHITE
2006
ACM
15 years 11 months ago
GPU-based rendering of sparse low-degree implicit surfaces
Implicit surface is a well-known surface representation. Geometric details of an object can be represented using less surface primitives than other representations such as polygon...
Takashi Kanai, Yutaka Ohtake, Hiroaki Kawata, Kiwa...
BMCBI
2004
167views more  BMCBI 2004»
15 years 4 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...